Please use this identifier to cite or link to this item:
Title: Generation of Symmetric Key Using Randomness of Hash Function
Authors: Charan K.S.
Nakkina H.V.
Chandavarkar B.R.
Issue Date: 2020
Citation: 2020 11th International Conference on Computing, Communication and Networking Technologies, ICCCNT 2020 , Vol. , , p. -
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. © 2020 IEEE.
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.