arXiv · 1509.05745
Narayana Sequences for Cryptographic Applications
Abstract
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.
Explore related subjects
Keep this discovery
Krishnamurthy Kirthi. 2015-09-17. Narayana Sequences for Cryptographic Applications. https://arxiv.org/abs/1509.05745
Cite the original work for its findings. Save a collection to share your selection of sources.