Narayana Sequences for Cryptographic Applications
This addresses the need for secure random sequences in cryptography, but it is incremental as it applies an existing method to a new mathematical series.
The paper tackled the problem of evaluating the Narayana series modulo a prime for cryptographic use, showing it has specific period lengths and strong autocorrelation and crosscorrelation properties suitable for applications like key generation.
This paper investigates the randomness and cryptographic properties of the Narayana series modulo p, where p is a prime number. It is shown that the period of the Narayana series modulo p is either p*p+p+1 (or a divisor) or p*p-1 (or a divisor). It is shown that the sequence has very good autocorrelation and crosscorrelation properties which can be used in cryptographic and key generation applications.