Narayana Sequences for Cryptographic Applications
arXiv:1509.05745
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.
10 pages
References in corpus (9)
- Entanglement entropy of aperiodic quantum spin chains
- A Review of Man-in-the-Middle Attacks
- The Piggy Bank Cryptographic Trope
- Entropy of Pseudo Random Number Generators
- A Survey of P2P Network Security
- Variations on the Fibonacci Universal Code
- Oblivious Transfer Protocol with Verification
- Multiparty Probability Computation and Verification
- Binary GH Sequences for Multiparty Communication