Skip to main content
SpringerLink
Log in

A triangular class of skew maximum-period polynomials

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

Abstract

Skew maximum-period polynomials (MP polynomials) are a kind of pseudorandom sequence generators with good cryptographic properties and efficient implementation on modern processors using parallelism technologies. There are two known classes of MP polynomials, presented in various papers (actually coinciding, as will be shown below), obtained constructively. Here we describe a wider class of skew MP polynomials.

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. Kurakin, V.L., Mikhalev, A.V., Nechaev, A.A., and Tsypyschev, V.N., Linear and Polynear Recurring Sequences over Abelian Groups and Modules, J. Math. Sci. (N.Y.), 2000, vol. 102, no. 6, pp. 4598–4626.

    MATH  Google Scholar 

  2. Gol’tvanitsa, M.A., Zaitsev, S.N., and Nechaev, A.A., Skew Linear Recurring Sequences of Maximal Period over Galois Rings, Fundam. Prikl. Mat., 2011/12, vol. 17, no. 3, pp. 5–23 [J. Math. Sci. (N.Y.) (Engl. Transl.), 2012, vol. 187, no. 2, pp. 115–128].

    MATH  Google Scholar 

  3. Chen, E. and Tseng, D., The Splitting Subspace Conjecture, Finite Fields Appl., 2013, vol. 24, pp. 15–28.

    Article  MATH  MathSciNet  Google Scholar 

  4. Tan, G.-M., Zeng, G., Han, W.-B., and Liu, X.-H., Construction and Enumeration of a Class of Primitive s-LFSR Sequences, J. Software, 2012, vol. 23, no. 4, pp. 952–961.

    Article  Google Scholar 

  5. Niederreiter, H., The Multiple-Recursive Matrix Method for Pseudorandom Number Generation, Finite Fields Appl., 1995, vol. 1, no. 1, pp. 3–30.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  7. Kurakin, V.L., Kuzmin, A.S., Mikhalev, A.V., and Nechaev, A.A., Linear Recurring Sequences over Rings and Modules, J. Math. Sci., 1995, vol. 76, no. 6, pp. 2793–2915.

    Article  MATH  MathSciNet  Google Scholar 

  8. Zaitsev, S.N., Description of Maximal Skew Linear Recurrences in Terms of Multipliers, Mat. Vopr. Kriptogr., 2014, vol. 5, no. 2, pp. 57–70.

    Google Scholar 

  9. Preneel, B., FSE’94–Introduction, Proc. 2nd Int. Workshop on Fast Software Encryption, Leuven, Belgium, Dec. 14–16, 1994, Preneel, B., Ed., Lect. Notes Comp. Sci., vol. 1008, Berlin: Springer, 1995, pp. 1–5.

    Google Scholar 

  10. Zeng, G., Han, W., and He, K., High Efficiency Feedback Shift Register: σ-LFSR, Cryptology ePrint Archive, 2007, Report 2007/114. http://eprint.iacr.org/2007/114.

    Google Scholar 

  11. Ghorpade, S.R., Hasan, S.U., and Kumari, M., Primitive Polynomials, Singer Cycles, and Word-Oriented Linear Feedback Shift Registers, Des. Codes Cryptography, 2011, vol. 58, no. 2, pp. 123–134.

    Article  MATH  MathSciNet  Google Scholar 

  12. Hawkes, P. and Rose, G.G., Primitive Specification and Supporting Documentation for SOBER-t16, Submission to NESSIE, 2000. https://www.cosic.esat.kuleuven.be/nessie/workshop/submissions/ sober-t16.zip.

    Google Scholar 

  13. Hawkes, P. and Rose, G.G., Primitive Specification and Supporting Documentation for SOBER-t32, Submission to NESSIE, 2000. https://www.cosic.esat.kuleuven.be/nessie/workshop/submissions/ sober-t32.zip.

    Google Scholar 

  14. Ekdahl, P. and Johansson, T., SNOW–A New Stream Cipher, in Proc. 1st Open NESSIE Workshop, Heverlee, Belgium, Nov. 13–14, 2000. https://www.cosic.esat.kuleuven.be/nessie/workshop/ submissions/snow.zip.

    Google Scholar 

  15. Ekdahl, P. and Johansson, T., A New Version of the Stream Cipher SNOW, Selected Areas in Cryptography (9th Annual Int. Workshop SAC’2002, St. John’s, Newfoundland, Canada, Aug. 15–16, 2002, Revised Papers), Nyberg, K. and Heys, H.M., Eds., Lect. Notes Comp. Sci., vol. 2595, Berlin: Springer, 2003, pp. 47–61.

    Google Scholar 

  16. Hawkes, P. and Rose, G.G., Turing: A Fast Stream Cipher, Fast Software Encryption (10th Int. Workshop FSE’2003, Lund, Sweden, February 24–26, 2003, Revised Papers), Johansson, T., Ed., Lect. Notes Comp. Sci., vol. 2887, Berlin: Springer, 2003, pp. 290–306.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center of Special Developments of the Ministry of Defence of the Russian Federation, Moscow, Russia

    S. N. Zaitsev

Authors
  1. S. N. Zaitsev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. N. Zaitsev.

Additional information

Original Russian Text © S.N. Zaitsev, 2016, published in Problemy Peredachi Informatsii, 2016, Vol. 52, No. 4, pp. 84–93.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zaitsev, S.N. A triangular class of skew maximum-period polynomials. Probl Inf Transm 52, 391–399 (2016). https://doi.org/10.1134/S0032946016040062

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Search

Navigation