Abstract
Maurer’s test is nowadays a basic statistical tool for testing physical random number generators in cryptographic applications. Based on a statistical analysis of this test we propose simple and effective methods for its improvement. These methods are related to the m – spacing technique common in goodness-of-fit problems and the L – leave out method used for a noise reduction in the final Maurer test statistic. We also show that the spacing distribution test represents a serious competitor for Maurer’s test in the case when the random number generator is governed by a Markov chain with a long memory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cressie, N.: On the logarithms of high-order spacings. Biometrika 63(2), 343–355 (1976)
Coron, J.-S., Naccache, D.: An Accurate Evaluation of Maurer’s Universal Test. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 57–71. Springer, Heidelberg (1999)
Coron, J.-S.: On the Security of Random Sources. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, p. 29. Springer, Heidelberg (1999), http://www.gemplus.com/smart/rd/publications
Del Pino, G.: On the asymptotic distribution of k-spacings with applications to goodness-of-fit tests. Ann. Statist. 8, 1058–1065 (1979)
Goubin, L., Patarin, J.: DES and Differential Power Analysis the ”Duplication” Method. In: Proceedings of CHESS 1999. LNCS. Springer, Heidelberg (1999)
Finner, H., Rotters, M.: Multiple hypothesis testing and expected number of type 1 errors. Ann. Statist. 30(1), 220–238 (2002)
Hall, P.: limit theorems for sums of general functions of m-spacings. Math. Proc. Cambridge Phil. Society 96, 517–532
Maurer, U.: A universal statistical test for random bit generators. J. Cryptology 5(2), 89–105 (1992)
National Institute of Standards and Technology, Security Requirements for Cryptographic Modules, FIPS 140-1 (January 1994), http://www.nist.gov/itl/div897/pubs/fip140-1.htm
National Institute of Standards and Technology, Security Requirements for Cryptographic Modules, FIPS 140-2 (May 2001), http://csrc.nist.gov/publications/fips/fips140-2/fips1402.pdf
Functionality Classes and Evaluation Methodology for Deterministic Random Number Generators, Version 2.0 (December 1999), http://www.bsi.de/zertifiz/zert/interpr/ais20e.pdf
Functionality Classes and Evaluation Methodology for True (physical) Random Number Generators, Version 3.1 (September 2001), http://www.bsi.bund.de/zertifiz/zert/interpr/trngk31e.pdf
Oswald, E., Preneel, B.: A Survey on Passive Side Channel Attacks and their Counter Measures for the Nessie Public-Key Cryptosystems, https://www.cosic.esat.kuleuven.be/nessie/reports/phase2/kulwp5-027-1.pdf
Pyke, R.: Spacings. J.R. Statist. Soc. B 27, 395–436 (1965)
Shilling, M.: Goodness of fit in ℝn based on weighted empirical distributions of certain neighbor statistics. Ann. Statist. 11, 1–12 (1983)
Weggenkitl, S.: Entropy estimators and Serial Tests for Ergodic Chains. IEEE Trans. Inform. Theory 47(6), 2480–2489 (2001)
Weiss, L.: Asymptotic of certain tests of fit based on sample spacings. Ann. Math. Statist. 28, 783–786 (1957)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El Haje, F., Golubev, Y., Liardet, P.Y., Teglia, Y. (2006). On Statistical Testing of Random Numbers Generators. In: De Prisco, R., Yung, M. (eds) Security and Cryptography for Networks. SCN 2006. Lecture Notes in Computer Science, vol 4116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832072_19
Download citation
DOI: https://doi.org/10.1007/11832072_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38080-1
Online ISBN: 978-3-540-38081-8
eBook Packages: Computer ScienceComputer Science (R0)