Secure and Efficient Hash Based Finishing Algorithm for Real Random Numbers

Abstract

Random numbers are the most important part of many applications, such as cryptographic applications, games of chance, game theory. The security of these applications is provided by secure random numbers. These secure numbers are true random and are generated from entropy sources. In the study, a post-processing algorithm is proposed for real random number generators. The last operation is the Keccak hash algorithm. Chaotic systems that used random characters for production of raw random numbers were used. With this method, safe random numbers were generated by applying the proposed post-processing algorithm. The numbers generated were shown that they did not contain statistical weaknesses by using NIST and autocorrelation tests, Moreover; the proposed finishing algorithm is more efficient than the other finishing methods. As a result, an efficient post-processing algorithm is devised which is safe for real random number generators.