Генератор равномерных случайных величин по технологии полного вихревого массива

23 / 25

А.Ф. Деон, Ю.А. Меняев
108 ISSN 0236-3933. Вестник МГТУ им. Н.Э. Баумана. Сер. Приборостроение. 2017. № 2
Просьба ссылаться на эту статью следующим образом:
Деон А.Ф., Меняев Ю.А. Генератор равномерных случайных величин по технологии
полного вихревого массива // Вестник МГТУ им. Н.Э. Баумана. Сер. Приборостроение.
2017. № 2. C. 86–110. DOI: 10.18698/0236-3933-2017-2-86-110
UNIFORM RANDOM QUANTITY GENERATOR USING COMPLETE
TWISTER ARRAY TECHNOLOGY
A.F. Deon1
Yu.A. Menyaev2
1 Bauman Moscow State Technical University, Moscow, Russian Federation
2 Winthrop P. Rockefeller Cancer Institute, University of Arkansas for Medical Science,
Little Rock, AR, USA
Abstract Keywords
Uniformly distributed random quantity generators are
widely used in various applications ranging from mathe-
matics, radio-electronic and technical designing to medi-
cal and biological research. This paper proposes a novel
approach to generating random quantities by combining
the initial congruent array with a global circular vortex
for complete stochastic sequences. We experimentally
confirmed that for the complete sequences generation of
this type provides random quantity uniform distribution.
The proposed software includes the generation technique
tuning methods where random quantities may take any
bit length. Moreover, we examined the automatic swit-
ching of such generator parameters as initial values and
congruent constants, which allowed us to increase the
amount of the options of the generated sequences. Fin-
dings of the research confirm the absolute uniformity of
distribution without any repeated or skipped elements in
generated sequences of random quantities
Pseudorandom quantity generator,
random sequences, congruent quanti-
ty, vortex generator
REFERENCES
[1] Tusnoo Y., Saito T., Suzaki T., Shigeri M., Miyauchi H. Cryptanalysis of DES implemented
on computers with cache. Proc. Cryptographic Hardware and Embedded Systems — CHES
2003. 5th Int. Workshop , 2003, pp. 62–76. DOI: 10.1007/978-3-540-45238-6_6
Available at:
[2] Ozturk E., Sunar V., Savas E. Low-power elliptic curve cryptography using scaled modular
arithmetic. Proc. Cryptographic Hardware and Embedded Systems — CHES 2004. 6th Int.
Workshop, 2004, pp. 92–106. DOI: 10.1007/978-3-540-28632-5_7
Available at:
[3] Panneton F., L'Ecuyer R., Matsumoto M. Improved long-period generators based on linear re-
currences modulo 2. ACMTOMS, 2006, vol. 32, no. 1, pp. 1–16. DOI: 10.1145/1132973.1132974
Available at: