The Transformation from the Galois NLFSR to the Fibonacci Configuration

Lin, Zhiqiang

doi:10.1109/eidwt.2013.64

Cited by 8 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Firstly, any output of sequence is always achieve the first and second of Golomb's postulates [11] with the cycle of 2 − 1, while the Galois (L,k)-NLFSRs does not achieve any of first and second of Golomb's postulates. Secondly, the output of sequence always equal the length of maximal period, while the Galois (L,k)-NLFSRs is not necessarily equal the length of maximum period [12], [10]. In other word,NLFSR Fibonacci give a pure cycles if the feedback function is a type of equation as shown below.…”

Section: Figure 3: An Example Of Fibonacci Nlfsrs [9]mentioning

confidence: 99%

The Robust Stream Cipher for Securing Data in the Smartphones

Abid

Zaiter

Atia

2019

JUBES

View full text Add to dashboard Cite

With the development of network and communication systems in large areas in the world, this leads to increase security problems in transmission of data such as data leakage, modification, unauthorized access, and attacks. There are many types of techniques that are used to prevent these problems and protect data. One of these techniques is a stream cipher which considered the strongest and fastest method used in encryption and decryption process. In this study presented a new design for the stream cipher to protect mobile data. The strength of stream cipher depends on it is' key. There are several methods to generate key. We used three types of generator. Then, it used the combiner to convert them into a nonlinear Boolean function in order to make the generator key more secure. To implement a new generator key by using these three kinds, we used four LFSRs and one of NLFSRs or FCSRs to produce five variables Boolean function. These variables will be as an input to the combiner function. Finally, we tested the generator and submitted it to the randomness tests that is publicly available in the National Institute of Standards and Technology (NIST).

show abstract

Section: Figure 3: An Example Of Fibonacci Nlfsrs [9]mentioning

confidence: 99%

The Robust Stream Cipher for Securing Data in the Smartphones

Abid

Zaiter

Atia

2019

JUBES

View full text Add to dashboard Cite

show abstract

“…For the Galois-to-Fibonacci case, there are only a few results have been published. In 2013, Lin [7] proposed a transformation from a Galois NLFSR to a Fibonacci NLFSR. This algorithm targets at Galois NLFSRs more general than the "uniform" case and studied the properties of the output sequences of all the bits in the Galois NLFSRs.…”

Section: Transformation Algorithmsmentioning

confidence: 99%

“…The rest of taps are replaced similarly. Suppose the relationship in (9) holds for clock t = k, similar to the proof for (7), the internal states of the transformed NLFSR at clock t = k can be calculated as…”

Section: For Each Monomial We Construct a Compensation List By Defini...mentioning

confidence: 99%

Generalized NLFSR Transformation Algorithms and Cryptanalysis of the Class of Espresso-like Stream Ciphers

Yao,

Parampalli

2019

Preprint

View full text Add to dashboard Cite

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 NLFSR initialized by a 128-bit key. The 2 256 − 1 maximum period is assured because the Galois NLFSR is transformed from a maximum length LFSR. However, we propose a Galois-to-Fibonacci transformation algorithm and successfully transform the Galois NLFSR into a Fibonacci LFSR with a nonlinear output function. The transformed cipher is broken by the standard algebraic attack and the Rønjom-Helleseth attack with complexity O(2 68.44 ) and O(2 66.86 ) respectively. The transformation algorithm is derived from a new Fibonacci-to-Galois transformation algorithm we propose in this paper. Compare to existing algorithms, proposed algorithms are more efficient and cover more general use cases. Moreover, the transformation result shows that the Galois NLFSR used in any Espresso-like stream ciphers can be easily transformed back into the original Fibonacci LFSR. Therefore, this kind of design should be avoided in the future.

show abstract

“…they are marked with « m »). In addition, many M-NLFSR functions that are not m-saturated by definition, achieve the highest possible result for the ) the tables 6-9 they are marked with « 1) »).Some of the obtained nonlinear recurrent relations of functions that are simultaneously m-optimal and m-saturated and that correspond with M-NLFSR[20][21][22][23][24][25][26][27][28][29].For 2 nd order M-70 functions with 10 monomials, 346 with 12 monomials, 1124 -14 monomials, 924 -16 monomials, 252 -18 monomials, 20 -20 monomials: By analyzing the results it can be seen that symmetric M-NLFSR have the same ) ( f sut and f N . All studied M-NLFSR with ( )…”

mentioning

confidence: 90%

Combining and Filtering Functions in the Framework of Nonlinear-Feedback Shift Register

Кuznetsov¹,

Potii²,

Poluyanenko³

et al. 2020

IJC

View full text Add to dashboard Cite

Strong cryptography of stream ciphers is determined according to the ability of the generated pseudorandom sequence to resist analytical attacks. One of the main components of the pseudorandom stream cipher sequence generating algorithm is Boolean functions for combining and filtering. The paper considers the possibility of applying nonlinear-feedback shift registers that generate a maximum length sequence as a combining or filtering function. The main indicators of cryptographic strength of such functions as: balance, the prohibitions presence, correlation immunity and nonlinearity are examined in this work. The study analyzes and demonstrates correlation immunity and nonlinearity experimental values for all nonlinear feedback shift registers that generate a maximum length sequence, for register sizes up to 6 cells inclusively, and register sizes up to 9 cells inclusively with algebraic degree of the polynomial under 2. The possibility of optimizing the process of selecting Boolean functions according to the criteria of maximum correlation immunity and nonlinearity with various algebraic degrees and minimization of the number of monomials in the polynomial is studied.

show abstract

The Transformation from the Galois NLFSR to the Fibonacci Configuration

Cited by 8 publications

References 12 publications

The Robust Stream Cipher for Securing Data in the Smartphones

The Robust Stream Cipher for Securing Data in the Smartphones

Generalized NLFSR Transformation Algorithms and Cryptanalysis of the Class of Espresso-like Stream Ciphers

Combining and Filtering Functions in the Framework of Nonlinear-Feedback Shift Register

Contact Info

Product

Resources

About