Random room noise for cryptographic key

Abstract

Noise in computer eco-system has been a nuisance to its users. However, white room noise has the potential to be a source of random numbers. Random numbers plays an in important role in cryptosystem. Due to the nature of random numbers, pseudorandom numbers are preferred instead due to it efficiency and reliability. As the name suggests, pseudorandom numbers are not truly random. Rather, they are computed from a mathematical formula. Pseudorandom numbers have the characteristic that they are predictable. The outputs of pseudorandom number generators only exhibit some of the properties of random numbers. Truly random numbers are believed to be generated only using hardware random number generators. Careful statistical analysis is still required to have any confidence the process and apparatus generates numbers that are sufficiently dasiarandompsila to suit the intended use. Choosing random secret keys is always recognized as an essential part of the security of cryptographic system. Even more today, it has become as an integral part of cryptographic algorithm. In this paper, raw white room noise typically disregarded element of digital eco-system shall be tested for its randomness according to the NIST Statistical Test Suite. Recommendation on using Tchebichef Polynomials on raw white room noise and pseudo-random numbers generator, Mersenne Twister as the cryptographic keys shall be reported.