We present a construction for a family of pseudo-random generators that are very fast in practice, yet possess provable statistical and cryptographic unpredictability properties. Such generators are useful for simulations, randomized algorithms, and cryptography. Our starting point is a slow but hi
โฆ LIBER โฆ
Design of Practical and Provably Good Random Number Generators
โ Scribed by Aiello, William (author);Rajagopalan, S. Raj (author);Venkatesan, Ramarathnam (author)
- Publisher
- Academic Press
- Year
- 1998
- Tongue
- English
- Weight
- 286 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Design of Practical and Provably Good Ra
โ
Aiello, William (author);Rajagopalan, S. Raj (author);Venkatesan, Ramarathnam (a
๐
Article
๐
1998
๐
Academic Press
๐
English
โ 286 KB
A Test of the Equivalence of Four Random
โ
Michael J. Rovine; Alexander von Eye; Constance J. Jones
๐
Article
๐
1992
๐
John Wiley and Sons
๐
English
โ 231 KB
๐ 2 views
Code construction of TLP random number s
โ
Kouichi Ohnuma; Risaburo Sato
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 224 KB
Engineering aspects of ozone generation.
โ
Carlins, James J.
๐
Article
๐
1982
๐
American Institute of Chemical Engineers
๐
English
โ 663 KB
Generation of pseudo-random numbers by c
โ
Junichiro Toyama; Shunji Kawamoto
๐
Article
๐
2008
๐
John Wiley and Sons
๐
English
โ 918 KB
An empirical comparison of random number
โ
J.Richard Landis; Alvan R. Feinstein
๐
Article
๐
1973
๐
Elsevier Science
๐
English
โ 341 KB
The use of Monte Carlo and other statistical procedures that depend on randomization of the observed data has been inhibited by uncertainty about the validity of random numbers generated by a computer. In the empirical test performed here, computergenerated numbers appeared to be just as "random" as