Narayana Sequences for Cryptographic Applications
Number Theory
2015-09-21 v1 Cryptography and Security
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.
Cite
@article{arxiv.1509.05745,
title = {Narayana Sequences for Cryptographic Applications},
author = {Krishnamurthy Kirthi},
journal= {arXiv preprint arXiv:1509.05745},
year = {2015}
}
Comments
10 pages