Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Shift Register Sequences
Synthesis of minimal cost nonlinear feedback shift registers
Signal Processing
A similarity transform for linear finite state machines
Discrete Applied Mathematics
On analysis and synthesis of (n, k)-non-linear feedback shift registers
Proceedings of the conference on Design, automation and test in Europe
A transformation from the Fibonacci to the Galois NLFSRs
IEEE Transactions on Information Theory
Fibonacci and Galois representations of feedback-with-carry shift registers
IEEE Transactions on Information Theory
Ring generators - new devices for embedded test applications
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
RFID security and privacy: a research survey
IEEE Journal on Selected Areas in Communications
| Hi-index | 754.84 |
The Fibonacci and the Galois configurations of non-linear feedback shift registers (NLFSRs) are considered. In the former, the feedback is applied to the input bit of the shift register only. In the latter, the feedback can potentially be applied to every bit. The sufficient conditions for equivalence of NLFSRs in the Fibonacci and the Galois configurations have been formulated previously. The equivalent NLFSRs in different configurations normally have to be initialized to different states to generate the same output sequences. The mapping between the initial states of two equivalent NLFSRs in the Fibonacci and the Galois configurations is derived in this paper.