Online test based on mutual information for true random number generators
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Shannon entropy is one of the widely used randomness mea-sures especially for cryptographic applications. However, the conventionalentropy tests are less sensitive to the inter-bit dependency in random sam-ples. In this paper, we propose new online randomness test schemes fortrue random number generators (TRNGs) based on the mutual infor-mation between consecutive k-bit output blocks for testing of inter-bitdependency in random samples. By estimating the block entropies ofdistinct lengths at the same time, it is possible to measure the mutualinformation, which is closely related to the amount of the statistical de-pendency between two consecutive data blocks. In addition, we proposea new estimation method for entropies, which accumulates intermediatevalues of the number of frequencies. The proposed method can estimateentropy with less samples than Maurer-Coron type entropy test can. Bynumerical simulations, it is shown that the new proposed scheme can beused as a reliable online entropy estimator for TRNGs used by crypto-graphic modules.
Abstract
Shannon entropy is one of the widely used randomness mea-sures especially for cryptographic applications. However, the conventionalentropy tests are less sensitive to the inter-bit dependency in random sam-ples. In this paper, we propose new online randomness test schemes fortrue random number generators (TRNGs) based on the mutual infor-mation between consecutive k-bit output blocks for testing of inter-bitdependency in random samples. By estimating the block entropies ofdistinct lengths at the same time, it is possible to measure the mutualinformation, which is closely related to the amount of the statistical de-pendency between two consecutive data blocks. In addition, we proposea new estimation method for entropies, which accumulates intermediatevalues of the number of frequencies. The proposed method can estimateentropy with less samples than Maurer-Coron type entropy test can. Bynumerical simulations, it is shown that the new proposed scheme can beused as a reliable online entropy estimator for TRNGs used by crypto-graphic modules.
참고문헌 (10)
- M. Bucci, "Design of Testable Random Bit Generators", Proc. CHES 2005, LNCS, 3659, pp.147~156 (2005)
- J.-S. Coron, "On the security of random sources", Proc. PKC’99, LNCS, 1560, pp.29~42 (1999)
- J.-S. Coron, "An accurate evaluation of Maurer’s universal test, Selected areas in cryptogra- phy", Lecture Notes in Comput. Sci., 1556, pp.57~71 (1999)
- T. M. Cover, "Elements of Information Theory" (1991), John Wiley & Sons, Inc.
- W. Killmann, "A proposal for: functionality classes and evaluation methodology for true (physical) random number generators, AIS.31 Version 3.1, Sep. 25", ~ (2001)
- U. M. Maurer, "A universal statistical test for random bit generators", J. Cryptology, 5(2), pp.89~105 (1992)
- W. Schindler, "Efficient online tests for true random number generators, in IACR Work- shop on Cryptographic Hardware and Embedded Systems", CHES 2001, LNCS, 2162, pp.103~117 (2001), Springer
- B. Sunar, "A provably secure true random number generator with built-in tolerance to active attacks", IEEE Trans. Computers, 56(1), pp.109~119 (2007)
- E. Trichina, "Supplemental cryptographic hardware for smart cards", IEEE Micro, 21(6), pp.26~35 (2001)
- I. Vasyltsov, "Fast digital TRNG based on metastable ring oscillator", Proc. CHES 2008, LNCS, 5154, pp.164~180 (2008)