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
Application of High-Quality Built-In Test to Industrial Designs
ITC '02 Proceedings of the 2002 IEEE International Test Conference
On analysis and synthesis of (n, k)-non-linear feedback shift registers
Proceedings of the conference on Design, automation and test in Europe
New Stream Cipher Designs
The Grain Family of Stream Ciphers
New Stream Cipher Designs
New Stream Cipher Designs
A transformation from the Fibonacci to the Galois NLFSRs
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
Searching short recurrences of nonlinear shift registers via directed acyclic graphs
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
An improved hardware implementation of the grain-128a stream cipher
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
The problem of efficient implementation of security mechanisms for advanced contactless technologies like RFID is gaining increasing attention. Severe constraints on resources such as area, power consumption, and production cost make the application of traditional cryptographic techniques to these technologies a challenging task. Non-Linear Feedback Shift Register (NLFSR)-based stream ciphers are promising candidates for cryptographic primitives for RFIDs because they have the smallest hardware footprint of all existing cryptographic systems. This paper presents a heuristic algorithm for constructing a fastest Galois NLFSR generating a given sequence. The algorithm takes an NLFSR in the Fibonacci configuration and transforms it to an equivalent Galois NLFSR which has the minimal delay. Our key idea is to find a best position for a given feedback connection without changing the positions of the other feedback connections. We use a technology dependent cost function which approximates the delay of an NLFSR after the technology mapping. The experimental results on 57 NLFSRs used in existing stream ciphers show that, on average, the presented algorithm allows us to decrease the delay by 25.5% as well as to reduce the area by 4.1%.