Hardware Random number Generator for cryptography
Ram Soorat, Madhuri K., Ashok Vudayagiri

TL;DR
This paper evaluates three methods of generating hardware-based random numbers for cryptography, analyzing their statistical properties and testing their unpredictability using NIST test suite.
Contribution
It introduces and compares three different hardware random number generation methods specifically for cryptographic applications.
Findings
All three methods produce statistically random sequences
NIST tests confirm the unpredictability of the generated numbers
The methods vary in complexity and suitability for different cryptographic needs
Abstract
One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is added to massage string to generate the encrypted code. It is represented as where is the message, is the key and is the ciphertext. It has been mathematically shown that this simple scheme is unbreakable is key K as long as M and is used only once. For a good cryptosystem, the security of the cryptosystem is not be based on keeping the algorithm secret but solely on keeping the key secret. The quality and unpredictability of secret data is critical to securing communication by modern cryptographic techniques. Generation of such data for cryptographic purposes typically requires an unpredictable physical source of random…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Coding theory and cryptography · Algorithms and Data Compression
