APERIODIC GENERATORS OF PSEUDORANDOM NUMBERS
Abstract
We presented a new algorithm for generating pseudorandom numbers which is based on solving equations of the form f(x)=0modpn (as n →∞). We suggest some method for constructing generator keys which enables us to generate aperiodic sequences. We study the statistical properties of these sequences using NIST STS. We also overview possible generalizations of this scheme.
About the Authors
S. F. Krendelev
Novosibirsk State University
Russian Federation
Russian Federation
S. F. Krendelev
Novosibirsk State University, Novosibirsk, Russia
A. Yu. Kuz′menok
Novosibirsk State Technical University
Russian Federation
Russian Federation
A. Yu. Kuz′menok
Novosibirsk State Technical University, Novosibirsk, Russia
References
1. Vinogradov I. M. An introduction to the theory of numbers. London and New York: Pergamon Press, 1955.
2. Klapper A., Goresky M. Feedback shift registers, 2-adic span, and combiners with memory //
3. J. Cryptology. 1997. V. 10. P. 111–147.
4. Dixon J. D. Exact solution of linear equations using P-adic expansions // Numer. Math 1982.
5. V. 40. P. 137–141.
6. A statistical test suite for random and pseudorandom number generators for cryptographic applications / Rukhin A. and others. NIST Special Publication 800-22 Revision 1a April 2010.
7. Stanley R. P. Enumerative combinatorics. Cambridge: Cambridge Univ. Press, 1999. V. 2.
Review
For citations:
Krendelev S.F., Kuz′menok A.Yu. APERIODIC GENERATORS OF PSEUDORANDOM NUMBERS. Mathematical notes of NEFU. 2014;21(4):31-38. (In Russ.)
Views:
19
JATS XML
Email this article 