On the security of random sources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1560, Issue , 1999, Pages 29-42

  Coron, Jean Sébastien ^a,b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b GEMPLUS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; COMPUTATION THEORY; DEFECTS; ENTROPY; NUMBER THEORY; RANDOM NUMBER GENERATION; TESTING;

COMMON RANDOMNESS; DETECTION OF DEFECTS; KEY SIZES; RANDOM NUMBER GENERATORS; RANDOM SOURCES; TEST FUNCTIONS; UNIVERSAL TEST;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84956866363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49162-7_3     Document Type: Conference Paper

References (8)

1. R. Ash, Information theory, Dover publications, New-York, 1965.
2. M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput., vol. 13, no. 4, pp. 850-864, 1984.
3. J.-S. Coron, D. Naccache, An accurate evalutation of Maurer’s universal test. Proceedings of SAC’98, Lecture notes in computer science, springer-verlag, 1998. To appear. Available at http://www.eleves.ens.fr:8080/home/coron/index.html.
4. FIPS 140-1, Security requirements for cryptographic modules, Federal Information Processing Standards Publication 140-1, U.S. Department of Commerce/N.I.S.T., National Technical Information Service, Springfield, Virginia, 1994.
5. D. Knuth, The art of computer programming, Seminumerical algorithms, vol. 2, Addison-Wesley publishing company, Reading, pp. 2-160, 1969.
6. U. Maurer, A universal statistical test for random bit generators, Journal of cryptology, vol. 5, no. 2, pp. 89-105, 1992.
7. C. Shannon, A mathematical theory of communication, The Bell system technical journal, vol. 27, pp. 379-423, 623-656, July-October, 1948.
8. J. Ziv, Compression tests for randomness and estimating the statistical model of an individual sequence, Sequences, pp. 366-373, 1990.