Skip to main content
SpringerLink
Log in

Decimation of M Sequences As a Way of Obtaining Primitive Polynomials

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract—

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

REFERENCES

  1. Korzhik, V.I. and Yakovlev, V.A., Osnovy kriptografii (Foundations of Cryptography), Intermediya, 2016.

  2. 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.

  3. Gill, A., Linear Sequential Circuits: Analysis, Synthesis, and Applications, Berkeley, Calif.: California Univ. Berkeley, 1966.

    Google Scholar 

  4. 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

    Book  Google Scholar 

  5. Lide, R. and Niederraiter, H., Finite Fields, Cambridge Univ. Press, 1988.

    Google Scholar 

  6. Anderson, O.R., Potochnye shifry. Rezul’taty zarubezhnoi otkrytoi kriptologii (Stream Ciphers: Results of Foreign Open Cryptology), Moscow: 1997.

  7. 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.

  8. 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.

Download references

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Author information

Authors and Affiliations

  1. The Bonch-Bruevich St. Petersburg State University of Telecommunications, 193232, St. Petersburg, Russia

    D. V. Kushnir & S. N. Shemyakin

Authors
  1. D. V. Kushnir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. N. Shemyakin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. V. Kushnir.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Translated by I. Obrezanova

Publisher’s Note.

Allerton Press remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kushnir, D.V., Shemyakin, S.N. Decimation of M Sequences As a Way of Obtaining Primitive Polynomials. Aut. Control Comp. Sci. 57, 928–932 (2023). https://doi.org/10.3103/S0146411623080138

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411623080138

Keywords:

Search

Navigation