Design of Decimation-Based Sequence Generators over Extended Fields
Linear Feedback Shift Registers are currently used as generators of pseudorandom sequences with application in many and different areas. In this work, analysis and software implementation of LFSRs defined over extended fields GF(2n) (where n is related to the size of the registers in the underlying processor) instead of over the binary field GF(2) have been considered. Once the migration from GF(2) into GF(2n) has been accomplished, a study of decimation-based sequence generators has been proposed. Definition of new decimation criteria as well as their software implementation and corresponding analysis complete the work.
KeywordsExtended LFSR software implementation decimation criterium stream cipher
Unable to display preview. Download preview PDF.
- 1.Paul, G., Maitra, S.: RC4 Stream Cipher and Its Variants. Discrete Mathematics and Its Applications. CRC Press, Taylor & Francis Group, Boca Raton (2012)Google Scholar
- 2.Bluetooth, Specifications of the Bluetooth system, Version 1.1, http://www.bluetooth.com/
- 4.Robshaw, M., Billet, O. (eds.): New Stream Cipher Designs: The eSTREAM Finalist. LNCS, vol. 4986. Springer, Heidelberg (2008)Google Scholar
- 5.Menezes, A.: Handbook of Applied Cryptography. CRC Press (1997)Google Scholar
- 9.Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)Google Scholar
- 14.Greenan, K., Miller, E., Schwarz, T.: Optimizing Galois field arithmetic for diverse processor architectures and applications. In: Miller, E., Williamson, C. (eds.) Proc. of MASCOTS, pp. 257–266. IEEE Press, New York (2008)Google Scholar