A design of reliable true random number generator for cryptographic applications

80Citations
Citations of this article
58Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The scheme of a device that should have a simple and reliable implementation and that, under simply verifiable conditions, should generate a true random binary sequence is defined. Some tricks are used to suppress bias and correlation so that the desired statistical properties are obtained without using any pseudorandom transformation. The proposed scheme is well represented by an analytic model that describes the system behaviour both under normal conditions and when different failures occur. Within the model, it is shown that the system is robust to changes in the circuit parameters. Furthermore, a test procedure can be defined to verify the correct operation of the generator without performing any statistical analysis of its output.

Cite

CITATION STYLE

APA

Bagini, V., & Bucci, M. (1999). A design of reliable true random number generator for cryptographic applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1717, pp. 204–218). Springer Verlag. https://doi.org/10.1007/3-540-48059-5_18

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