A Class of Random Sequences for Key Generation
This work addresses the need for efficient and secure key generation in cryptography, but it appears incremental as it builds on known mathematical sequences.
The paper tackles the problem of generating random sequences for key distribution by analyzing sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m, showing that sequences modulo a prime yield better autocorrelation properties, making them suitable candidates due to low computational complexity.
This paper investigates randomness properties of sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m for use in key distribution applications. We show that for sequences modulo a prime a binary random sequence B(n) is obtained based on whether the period is p-1 (or a divisor) or 2p+2 (or a divisor). For the more general case of arbitrary m, we use the property if the period is a multiple of 8 or not. The sequences for prime modulo have much better autocorrelation properties. These are good candidates for key distribution since the generation process is not computationally complex.