Abstract
In a highly secure and robust key generation process, a key role is played by randomness and random numbers when current real-world cryptosystems are observed. Most present-day cryptographic protocols depend upon the Random Number Generators (RNG), Pseudo-Random Number Generator (PRNG). These protocols often use noisy channels such as Disk seek time, CPU temperature, Mouse pointer movement, Fan noise to obtain actual random values. Despite being cost-effective, these noisy channels may need additional hardware devices to communicate with them continuously. On the other hand, Hash functions are Pseudo-Random (because of their requirements) in nature. So, they are a suitable replacement for these noisy channels and have low hardware requirements. This paper discusses some of the key generation methodologies and their drawbacks. Further, it explains how hash functions can be used in key generation, how to combine Key Derivation Function (KDF)s with hash functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
