Construction of Maximum Period Linear Feedback Shift Registers (LFSR) (Primitive Polynomials and Linear Recurring Relations)
| Autor: | Babacar Alassane Ndaw, Djiby Sow, Mamadou Sanghare |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Pseudorandom number generator
Theoretical computer science business.industry Code division multiple access Self-shrinking generator Cryptography Pseudorandom generator Encryption Computer Science::Hardware Architecture General Earth and Planetary Sciences Arithmetic business Stream cipher Computer Science::Cryptography and Security General Environmental Science Shift register Mathematics |
| Zdroj: | British Journal of Mathematics & Computer Science. 11:1-24 |
| ISSN: | 2231-0851 |
| DOI: | 10.9734/bjmcs/2015/19442 |
| Popis: | Feedback Shift Register (FSR) is generally the basic element of pseudo random generators used to generate cryptographic channel or set of sequences for encryption keys. This type of generator is widely used in stream cipher and communication systems such as C.D.M.A (Code Division Multiple Access), mobile communication systems, ranging and navigating systems, spread spectrum communication systems. The objective of the present paper is to propose a method for determining linear recurring sequences generating linear feedback shift register (LFSR) from primitive polynomials (and vice-versa). The linear recurring sequences facilitate the construction of maximum length LFSR. It also insists, in the last part, on the cryptographic security of LFSR and indicates some open problems in the area of nonlinear feedback shift registers (NLFSR) based pseudo random generators. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|