Skip to main content
Log in

Generators of the equiprobable pseudorandom nonmaximal-length sequences based on linear-feedback shift registers

  • Stochastic Systems, Queueing Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The generators of equiprobable pseudorandom sequences producing heterogeneous recurring nonmaximal-length sequences on the basis of the linear-feedback shift register were discussed. The probability and correlation characteristics of the inverse-segment (M–1)-, (M–3)-and (M–7)-sequences were considered. A generator forming (M–7)-sequences was discussed. The problem of generator initialization to maintain the operational modes was solved.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ivanova, V.M., Sluchainye chisla i ikh primenenie (Random Numbers and Their Application), Moscow: Finansy i Statistika, 1984.

    Google Scholar 

  2. Ivanov, M.A. and Chugunov, I.V., Teoriya, primenenie i otsenka kachestva generatorov psevdosluchainykh posledovalel’nostei (Theory, Application and Estimation of Performance of the Pseudorandom Sequence Generators), Moscow: KUDITs-OBRAZ, 2003.

    Google Scholar 

  3. Kuznetsov, V.M. and Pesoshin, V.A., Generatory psevdosluchainykh i sluchainykh posledovetel’nostei na tsifrovykh elementakh zaderzhki (Generators of Random and Pseudorandom Sequences Based on Digital Delay Elements), Kazan: Kazan. Gos. Tekhn. Univ., 2013.

    Google Scholar 

  4. Pesoshin, V.A. and Kuznetsov, V.M., Generatory psevdosluchainykh i sluchainykh chisel na registrakh sdviga (Generators of Pseudorandom and Random Numbers Based on Shift Registers), Kazan: Kazan. Gos. Tekhn. Univ., 2007.

    Google Scholar 

  5. Shneier, B., Applied Cryptography. Protocols, Algorithms and Source Code in C, New York: Wiley, 1996. Translated under the title Prikladnaya kriptografiya, Moscow: Triumf, 2002.

    Google Scholar 

  6. Gill, A., Linear Sequential Circuits; Analysis, Synthesis, and Applications, New York: McGraw-Hill, 1966. Translated under the title Lineinye posledovatel’nostnye mashiny, Moscow: Nauka, 1974.

    MATH  Google Scholar 

  7. Kiryanov, B.F., Kuznetsov, V.M., and Pesoshin, V.A., A Refined Formula for the Autocorrelation Function of an M-sequence, Autom. Remote Control, 2015, vol. 76, no. 7, pp. 1221–1228.

    Article  MathSciNet  MATH  Google Scholar 

  8. Kugurakov, V.S. and Sokolov, O.B., Set of Cycle Lengths of One-to-One Affine Mappings of the Space Vn (GF(p)) on Itself, Uchen. Zap. Kazan. Gos. Univ., 1969, vol. 129, part 4, pp. 74–79.

    MathSciNet  MATH  Google Scholar 

  9. Fedorov, R.F., Yakovlev, V.V., and Dobris, G.V., Stokhasticheskie preobrazovateli informatsii (Stochastic Information Translators), Leningrad: Mashinostroenie, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Pesoshin.

Additional information

Original Russian Text © V.A. Pesoshin, V.M. Kuznetsov, D.V. Shirshova, 2016, published in Avtomatika i Telemekhanika, 2016, No. 9, pp. 136–149.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pesoshin, V.A., Kuznetsov, V.M. & Shirshova, D.V. Generators of the equiprobable pseudorandom nonmaximal-length sequences based on linear-feedback shift registers. Autom Remote Control 77, 1622–1632 (2016). https://doi.org/10.1134/S0005117916090095

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117916090095

Navigation