Results 51 to 60 of about 535 (102)
Some Words on Cryptanalysis of Stream Ciphers [PDF]
, 2006 In the world of cryptography, stream ciphers are known as primitives used to ensure privacy over a communication channel. One common way to build a stream cipher is to use a keystream generator to produce a pseudo-random sequence of symbols.
Maximov, Alexander
core
Hash and Physical Unclonable Function (PUF)-Based Mutual Authentication Mechanism. [PDF]
Sensors (Basel), 2023 Bhatia K, Pandey SK, Singh VK, Gupta DN.
europepmc +1 more source
Discussion on Secure Standard Network of Sensors Powered by Microbial Fuel Cells. [PDF]
Sensors (Basel), 2023 da Rocha H +4 more
europepmc +1 more source
Symmetric block ciphers with a block length of 32 bit [PDF]
, 2018 Subject of the thesis at hand is the analysis of symmetric block ciphers with a block length of 32 bit. It is meant to give a comprising overview over the topic of 32 bit block ciphers. The topic is divided in the examination of three questions.
Rothe, Stephan
core
A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs [PDF]
IEEE Transactions on Information Theory, 2013 A method for constructing n-stage Galois NLFSRs with period 2n-1 from n-stage maximum length LFSRs is presented. Nonlinearity is introduced into state cycles by adding a nonlinear Boolean function to the feedback polynomial of the LFSR. Each assignment of variables for which this function evaluates to 1 acts as a crossing point for the LFSR state cycle.
openaire +1 more source
On the cycle decomposition of the WG-NLFSR [PDF]
, 2014 Recently, Kalikinkar Mandal and Guang Gong presented a family of nonlinear pseudorandom number generators using Welch-Gong Transformations in their paper [6]. They also performed the cycle decomposition of the WG-NLFSR recurrence relations over different
Huaifu Wang +3 more
core
Design and Analysis of Cryptographic Pseudorandom Number/Sequence Generators with Applications in RFID [PDF]
, 2013 This thesis is concerned with the design and analysis of strong de Bruijn sequences and span n sequences, and nonlinear feedback shift register (NLFSR) based pseudorandom number generators for radio frequency identification (RFID) tags.
Mandal, Kalikinkar
core
An equivalence preserving transformation from the Fibonacci to the Galois NLFSRs
, 2008 14 pages, 4 figures, one reference added, example 4 ...
openaire +2 more sources
, 2014 We present the characteristic and minimal polynomials of the linear algorithms Trivium and Trivium Toy. We show the different cycles and mini-mum lengths obtained. The existence of initial states determining short cycles is verified.
Castro Lechtaler, Antonio +5 more
core
, 2019 Lightweight stream ciphers are highly demanded in IoT applications. In order to optimize the hardware performance, a new class of stream cipher has been proposed. The basic idea is to employ a single Galois NLFSR with maximum period to construct the cipher. As a representative design of this kind of stream ciphers, Espresso is based on a 256-bit Galois
Yao, Ge, Parampalli, Udaya
openaire +2 more sources