A pseudorandom sequences generator based on the multimodulo transformation.

Yurii Gorbenko V.N. Karazin Kharkiv National University
Tetiana Grinenko Kharkiv National University of Radio Electronics
Oleksii Nariezhnii Kharkiv National University of Radio Electronics
Nikołay Karpinskiy University of Bielsko-Biala

Keywords: Pseudorandom sequence, Pseudorandom sequence generator, Multimodulo transformation, Galois field, Distinguishing, Unpredictability, Irreversibility, Repetition period, Complexity

Abstract

Main theoretical statements and practical research results of pseudorandom sequences over arbitrary alphabet generation based on multimodulo transformation in the finite field GF(pⁿ) are given, results of properties analysis on distinguishing, unpredictability, irreversibility, repetition period and complexity (performance) are brought.

Downloads

Download data is not yet available.

Author Biographies

Yurii Gorbenko, V.N. Karazin Kharkiv National University

Ph.D.

Tetiana Grinenko, Kharkiv National University of Radio Electronics

Ph.D., docent

Oleksii Nariezhnii, Kharkiv National University of Radio Electronics

Ph.D.

Nikołay Karpinskiy, University of Bielsko-Biala

Doctor of Sciences (Engineering), Full Prof.

References

Methods and means of pseudorandom sequences generation /Y. Gorbenko, T. Grіnenko, N. Shapochka, A. Neyvanov, R. Mordvіnov// Applied Radio Electronics . - 2011. - Vol. 10. - №2. - P. 141-152. (in Ukrainian).

Potiy A.V. Method of multimodulo transformation of numbers / A.V. Potiy // Information processing and control of managing systems reliability: сollection of the science papers. – Kh., 1997. – P.63-68. (in Ukrainian).

Grіnenko T.O. Properties of determined random sequences generated on the basis is of multimodulo transformation in Galois fields/ T.O. Grіnenko, Y.І. Gorbenko // Collection of the science papers of Kharkiv University of the Science Force. – 2011. – Pub. 1(27). – P.136–139. (in Ukrainian).

Application Notes and Interpretation of the Scheme (AIS) 20. Functionality classes and evaluation methodology for Deterministic random number generators. Certification body of the BSI in context of certification scheme. BSI, 1999.

Information technology. Security techniques. Random bit generation: ISO/IEC 18031. - 2005.

Potiy A.V. Static testing of random and pseudorandom numbers generators with the use of NIST STS static test collection/ A.V.Potiy, S.Y.Orlova, T.A Grinenko // Legal, regulatory and metrologіcal support of information security in Ukraine. – 2001. – Pub. 2. – P.206–214. (in Ukranian).

NIST SP 800-22. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. April 2000. http://csrc.nist.gov/publications/nistpubs/800-22-rev1a/SP800-22rev1a.pdf.

Vinogradov I.M . Main theories of numbers/ I.M Vinogradov. – M.: Science, 1981. – 177 p. (in Russian).

Lidl R. The finite fields: In 2 vol. / R. Lidl, G. Niderrayter. – M.: Mir, 1988. – Vol.2. – 822 p.(in Russian).

Gorbenko Y.І. Methods of pseudorandom sequences generator assessment based on multimodulo transformations in the finite fields/ Y.І. Gorbenko // Radio technique: All-Ukranian. Mezhved. Scien-Tech. Col. – 2011. – Pub. 165. – P.249-253. (in Russian).

Shnayer B. Applied Cryptography. Protocols, algorithms, reference texts in SI language/ B. Shnayer. – M.: Triumph, 2002. – 797 p. (in Russian).

Stollings V. Cryptography and nets security / V. Stollings. – M. :Wiliams, 2001. – 669 p. (in Russian).

Information technology. Security techniques. Hash-functions. Part 2. Hash-functions using an n-bit block cipher: ISO/IEC 10118-2.

Information technology. Security techniques. Hash-functions. Part 3. Dedicated hash-functions: ISO/IEC 10118-3.

Information technology. Security techniques. Digital signature schemes giving message recovery. Part 3. Discrete logarithm based mechanisms: ISO/IEC 9796-3:2006.

Information technologies. Cryptographic information security. Digital signature based on elliptic curves. Forming and Checking: DSTU (State Standards of Ukraine) 4145-2002.