Decimation of M Sequences As a Way of Obtaining Primitive Polynomials
Tóm tắt
One approach to obtain a cryptographically strong encryption gamma is to use linear-feedback shift registers defined by primitive polynomials. The ability to quickly select the appropriate polynomial can provide the required degree of security of the stream cipher. Currently, primitive polynomials for sufficiently large degrees are known, but usually these are so-called sparse polynomials. To increase the correlational stability, it is necessary to be able to quickly generate new primitive polynomials of the given degrees, which is the focus of this study.
Từ khóa
Tài liệu tham khảo
Korzhik, V.I. and Yakovlev, V.A., Osnovy kriptografii (Foundations of Cryptography), Intermediya, 2016.
Uteshev, A.Yu., Galua fields, Zapisnaya knizhka Utesheva Alekseya Yur’evicha (Notebook of A.Yu. Uteshev). http://vmath.ru/vf5/gruppe/galois#polja_galua. Cited November 1, 2022.
Gill, A., Linear Sequential Circuits: Analysis, Synthesis, and Applications, Berkeley, Calif.: California Univ. Berkeley, 1966.
Menezes, A.J., Van Oorschot, P.C., and Vanstone, S.A., Handbook of Applied Cryptography, New York: CRC Press, 1996. https://doi.org/10.1201/9781439821916
Lide, R. and Niederraiter, H., Finite Fields, Cambridge Univ. Press, 1988.
Anderson, O.R., Potochnye shifry. Rezul’taty zarubezhnoi otkrytoi kriptologii (Stream Ciphers: Results of Foreign Open Cryptology), Moscow: 1997.
Kabanov, V.V., Uchebno-metodicheskii kompleks distsipliny Konechnye polya (Educational-Methodological Complex of the Discipline Finite Fields), Ekaterinburg: Ural’skii Gosudarstvennyi Universitet im. A.M. Gor’kogo, 2008.
Golomb, S.W., Shift Register Sequences (Book on Shift Register Sequence Theory, Discussing Applications in Communications, Computers and Switching Theory, San Francisco: Holden-Day, 1967.