The selection of forming polynomials for shift register with nonlinear feedback second order that generates the sequence with maximum period.
Abstract
Model pseudo-random sequence generator based on shift registers with nonlinear feedback second order is considered. Additional requirements for type of polynomial are formulated. They limit the set of polynomials which generate a sequence with maximum period. The expression to determine the number of polynomials that do not meet the requirements is given. Quantitative estimation of the impact of each request on cuts the set of polynomials is given. Recommendations for the use of these requirements are formulated.
Downloads
References
Ivanov M.A. Kriptograficheskie metody zashchity informatsii v komp'yuternykh sistemakh i setyakh / M.A. Ivanov. – Moskva: Kudits-obraz, 2001. – 368 s.
Beth T. The stop-and-go generator, Proceeding Eurocrypt / T. Beth, F.C. Piper // Springer- Verlag Lecture Notes in Computer Science. – 1984. – №209.
Chambers W.G. Clock-controlled shift-registers in binary sequence generators / W.G. Chambers // IEEE Proceedings. – 1988. – 135 p.
Klapper A. Large periods nearly de Bruijn FCSR sequences / A. Klapper, M. Goresky. – Cryptology EuroCrypt, 1995.
Potochnye shifry / Asoskov A.V., Ivanov M.A., Mirskii A.A. i dr. – Moskva: Kudits-obraz, 2003. – 336 s.
Potii A.V. Analiz svoistv registrov sdviga s nelineinoi obratnoi svyaz'yu vtorogo poryadka generiruyushchikh posledovatel'nost' s maksimal'nym periodom / A.V. Potii, N.A. Poluyanenko // Prikladnaya radioelektronika. – 2008. – № 3. – S. 282-290.
Stasev Yu.V., Potii A.V, Izbenko Yu.A. Issledovanie metodov kriptoanaliza potochnykh shifrov [Elektronnyi resurs]. – Rezhim dostupa: http://www.nrjetix.com/fileadmin/doc/publications/articles/stasev_potiy_izbenko_ru.pdf.