Skip to main content
SpringerLink
Log in

Occurrence numbers for vectors in cycles of output sequences of binary combining generators

  • Information Protection
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We give formulas for computing the occurrence frequencies of r-tuples in cycles of output sequences of combining generators over the two-element field. From these formulas we derive some estimates for these frequencies.

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

Similar content being viewed by others

References

  1. Glukhov, M.M., Elizarov, V.P., and Nechaev, A.A., Algebra, Moscow: Gelios ARV, 2003, Part2.

    Google Scholar 

  2. Lidl, R. and Niederreiter, H., Finite Fields, Reading: Addison-Wesley, 1983. Translated under the title Konechnye polya, 2 vols., Moscow: Mir, 1988.

    MATH  Google Scholar 

  3. Alferov, A.P., Zubov, A.Yu., Kuz’min, A.S., and Cheremushkin, A.V., Osnovy kriptografii (Fundamentals of Cryptography), Moscow: Gelios ARV, 2001.

    Google Scholar 

  4. Fomichev, V.M., Metody diskretnoi matematiki v kriptologii (Methods of Discrete Mathematics in Cryptology), Moscow: Dialog-MIFI, 2010.

    Google Scholar 

  5. Rueppel, R.A., Analysis and Design of Stream Ciphers, Berlin: Springer-Verlag, 1986.

    Book  MATH  Google Scholar 

  6. Fomichev, V.M., On Periods of Complicated Sequences, Mat. Vopr. Kibern.v, vol. 13, Moscow: Fizmatlit, 2004, pp. 37–40.

    Google Scholar 

  7. Bilyak, I.B. and Kamlovskii, O.V., Frequency Characteristics of Cycles in Output Sequences Generated by Combining Generators over the Field of Two Elements, Prikl. Diskr. Mat., 2015, no. 3 (29), pp. 17–31.

    Google Scholar 

  8. Logachev, O.A., Sal’nikov, A.A., and Yashchenko, V.V., Bulevy funktsii v teorii kodirovaniya i kriptologii (Boolean Functions in Coding Theory and Cryptology), Moscow: MCCME, 2012, 2nd ed.

    MATH  Google Scholar 

  9. Niederreiter, H., Weights of Cyclic Codes, Inform. Control., 1977, vol. 34, no. 2, pp. 130–140.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Limited Liability Company “Certification Test Center,”, Moscow, Russia

    O. V. Kamlovskii

Authors
  1. O. V. Kamlovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. V. Kamlovskii.

Additional information

Original Russian Text © O.V. Kamlovskii, 2017, published in Problemy Peredachi Informatsii, 2017, Vol. 53, No. 1, pp. 92–100.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kamlovskii, O.V. Occurrence numbers for vectors in cycles of output sequences of binary combining generators. Probl Inf Transm 53, 84–91 (2017). https://doi.org/10.1134/S0032946017010070

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Search

Navigation