Random number generator for cryptography

R. Soorat – R. C. Bose centre for cryptology and security, Indian Statistical Institute, Kolkata; School of Physics, University of Hyderabad, Hyderabad 500046, India; rsoorat@gmail.com
K. Madhuri – School of Physics, University of Hyderabad, Hyderabad 500046, India.
A. Vudayagiri – School of Physics, University of Hyderabad, Hyderabad 500046, India.

One key requirement for many cryptograhic schemes is the generation of random numbers. Sequences of random numbers are used at several stages of a standard cryptographic protocol. One simple example is a Vernam cipher, where a string of random numbers is added to message string to generate encrypted code. C = M ⊕ K. It has been mathematically shown that this simple scheme is unbreakable if key K is as long as M and is used only once. The security of a cryptosystem shall not be based on keeping the algorithm secret but solely on keeping the key secret. The security of a random number generator (RNG) is related to the difficulty of predicting its future sequence values from past values. The quality and unpredictability of secret data is critical to securing communication by modern cryptographic techniques. The generation of such data for cryptographic purposes typically requires an unpredictable physical source of random data. We studied a chaotic circuit which consisted of an inductor, capacitance, diode and thus used for the BB84 protocol. We have studied both pseudo random and true random number generators and evaluated them through various tests like frequency, correlation, NIST etc.

Keywords: Hardware random number generator, cryptography, chaos, chaotic circuit.

PACS 07.05.Hd

DOI 10.17586/2220-8054-2017-8-5-600-605


Comments are closed.