Please use this identifier to cite or link to this item:
|Title:||A random key generation scheme using primitive polynomials over GF(2)|
|Citation:||Communications in Computer and Information Science, 2016, Vol.625, , pp.42-51|
|Abstract:||A new key generation algorithm is proposed using primitive polynomials over Glaois Field GF(2). In this approach, we have used MD5 algorithm to digest the system time and IP address of the system. The combination of these digest values acts as random seed for the key generation process. The randomness test for the generated key is performed by using Blum Blum Shub (BBS), Micali-Schnorr and Mersenne Twister (MT19937) PRNG algorithms. The generated key has been compared on the basis of the combination of 2 bit, 3 bit, 4 bit and 8 bit count values of 0�s and 1�s. In this paper, we have used chi squared test, R squared test and standard deviation to check the randomness of the generated key. We have analyzed our result based on the above three criteria and observed that the proposed algorithm achieves lower dispersion in 72.5% of the test cases, lower error rate in 61.6% of the test cases and higher fitness value in 68.3% of the test cases. � Springer Nature Singapore Pte Ltd. 2016.|
|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.