|
Construction of RNG using random automata and “one-way” functions
V. O. Popov, S. V. Smyshlyaeva a LLC "CRYPTO-PRO", Moscow
Abstract:
We consider a number of practical issues related to requirements for pseudorandom number generators used for cryptographic software needs. They extend further than general requirements of (practical) indistinguishability of output sequence from the sequence of independent uniformly distributed random variables. We formulate these additional requirements and present a general construction of RNG for usage in cryptographic software that is proposed to meet all of them.
Key words:
random number generators, key generation, cryptoproviders, random automata.
Received 25.IX.2013
Citation:
V. O. Popov, S. V. Smyshlyaev, “Construction of RNG using random automata and “one-way” functions”, Mat. Vopr. Kriptogr., 5:2 (2014), 109–115
Linking options:
https://www.mathnet.ru/eng/mvk123https://doi.org/10.4213/mvk123 https://www.mathnet.ru/eng/mvk/v5/i2/p109
|
Statistics & downloads: |
Abstract page: | 357 | Full-text PDF : | 196 | References: | 38 | First page: | 3 |
|