Online test based on mutual information for true random number generators

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Shannon entropy is one of the widely used randomness mea- sures especially for cryptographic applications. However, the conventional entropy tests are less sensitive to the inter-bit dependency in random sam- ples. In this paper, we propose new online randomness test schemes for true random number generators (TRNGs) based on the mutual infor- mation between consecutive k-bit output blocks for testing of inter-bit dependency in random samples. By estimating the block entropies of distinct lengths at the same time, it is possible to measure the mutual information, which is closely related to the amount of the statistical de- pendency between two consecutive data blocks. In addition, we propose a new estimation method for entropies, which accumulates intermediate values of the number of frequencies. The proposed method can estimate entropy with less samples than Maurer-Coron type entropy test can. By numerical simulations, it is shown that the new proposed scheme can be used as a reliable online entropy estimator for TRNGs used by crypto- graphic modules. © 2013 The Korean Mathematical Society.

Cite

CITATION STYLE

APA

Kim, Y. S., Yeom, Y., & Bong Choi, H. (2013). Online test based on mutual information for true random number generators. Journal of the Korean Mathematical Society, 50(4), 879–897. https://doi.org/10.4134/JKMS.2013.50.4.879

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free