RESEARCH OF PERIODIC PROPERTIES OF PSEUDO-ACCIDENTAL NUMBERS GENERATORS, BASED ON THE USE OF EXCESS BLOCK CODES

The development of computational technology and the growing needs of Internet resources are putting forward new demands on the quality of service for users of global and local computational networks based on Ethernet technologies. The main criteria for the quality of network user service are reliability and security. To ensure reliability, as a rule, methods based on jam resistant coding or protocols with decision-making feedback are used. For security, cryptographic protocols for symmetric and asymmetric cryptography, hashing algorithms and digital signatures are used. Random number generators occupy a special place among the mechanisms that ensure the reliability and security. This work discusses the methods of forming sequences of pseudo-random numbers (SPRN), the stability of which is based on the theoretical complexity problem of syndromic decoding. Periodic properties of generators are investigated, it is determined that the formed sequences do not have a maximum period.

RESEARCH OF PERIODIC PROPERTIES OF PSEUDO-ACCIDENTAL NUMBERS GENERATORS, BASED ON THE USE OF EXCESS BLOCK CODES

The development of computational technology and the growing needs of Internet resources are putting forward new demands on the quality of service for users of global and local computational networks based on Ethernet technologies. The main criteria for the quality of network user service are reliability and security. To ensure reliability, as a rule, methods based on jam resistant coding or protocols with decision-making feedback are used. For security, cryptographic protocols for symmetric and asymmetric cryptography, hashing algorithms and digital signatures are used. Random number generators occupy a special place among the mechanisms that ensure the reliability and security. This work discusses the methods of forming sequences of pseudo-random numbers (SPRN), the stability of which is based on the theoretical complexity problem of syndromic decoding. Periodic properties of generators are investigated, it is determined that the formed sequences do not have a maximum period.

___

  • 1. Kuznetsov, A., Korolev, V., “Investigation of the statistical safety of pseudorandom number generators”, System processing information "HUPS", v. 3, n. 70, pp. 79 – 82, 2008.
  • 2. Ivanov, M., “Theory, application and quality assessment of pseudo-random sequence generators”, 240 p., KUDITS-IMAGE, 2003.
  • 3. Popovsky, V., “Information security in telecommunication systems”, Kharkiv National University of Radio Electronics, Company Smith Company, 238 p. 2006.
  • 4. Blum, L., “A Simple Unpredictable Pseudo-Random Number Generator”, Siam Journal on Computing, v.15, n.2, pp.364-386, 1986.
  • 5. Schneier, B., “Applied cryptography. Protocols, algorithms, source texts in the C language”, 819 p., Publishing house TRIUMPH, 2002.
  • 6. Final report of European project number IST-1999-12324, named New European Schemes for Signatures, Integrity, and Encryption, v. 0.15 (beta), Springer-Verlag, p 829, 2004.
  • 7. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22. Technology Administration U.S. Department of Commerce. – Washington: National Institute of Standards and Technology, р. 164, 2000.
  • 8. National Institute of Standards and Technology, “FIPS-197: Advanced Encryption Standard.” Nov. 2001. Available at: http://csrc.nist.gov/publications/fips/ fips197/fips-197.pdf
  • 9. Fisher, J., Stern, J., “An efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding”, EUROCRYPT’96 Proceeding, LNCS 1070, p. 245 – 255.
  • 10. McWilliams, F.J., Sloan, N.J.A, “The theory of error correction codes”, 744 p., Communication, 1979.
International Journal of 3D Printing Technologies and Digital Industry-Cover
  • ISSN: 2602-3350
  • Yayın Aralığı: Yılda 3 Sayı
  • Başlangıç: 2017
  • Yayıncı: KERİM ÇETİNKAYA