Abstract
Linear Feedback Shift Registers (LFSRs) are used as pseudorandom keystream generators in cryptographic schemes. Hardware implementation of LFSRs are simple and fast but their software implementation is not quite efficient. Here we present a fast software implementation strategy for the LFSRs. The output will be available as a block of bits after each operation. We discuss theoretical issues for such block oriented implementation and present necessary algorithms. We clearly identify the constraints in the choice of connection polynomials for block oriented implementation. Actual implementation results have been presented in support of our claims. The results emphasise the usability of LFSRs in software based stream cipher systems.
Keywords
- Block Oriented LFSR
- Connection Polynomials
- Stream Cipher
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Ding, G. Xiao, and W. Shan. The Stability Theory of Stream Ciphers. Number 561 in Lecture Notes in Computer Science. Springer-Verlag, 1991.
S. W. Golomb. Shift Register Sequences. San Fransisco, CA, Holden-Day, 1967.
R. Lidl and H. Niederreiter. Finite Fields. Addison Wesley, 1983.
S. Maitra and P. Sarkar. Efficient implementation of ciphertext only attack on LFSR based encryption schemes. In National Seminar on Cryptology, pages 1–12, July 9–10 1998.
A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
M. Zhang, C. Carrol, and A. Chan. The software-oriented stream cipher SSC2. In Fast Software Encryption-FSE 2000, in Lecture Notes in Computer Science. Volume 1978, Springer Verlag, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chowdhury, S., Maitra, S. (2001). Efficient Software Implementation of Linear Feedback Shift Registers. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_28
Download citation
DOI: https://doi.org/10.1007/3-540-45311-3_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43010-0
Online ISBN: 978-3-540-45311-6
eBook Packages: Springer Book Archive
