New sequences from the generalized Pell p-numbers and mersenne numbers and their application in cryptography.

This paper presents the generalized Pell p-numbers and provides some related results. A new sequence is defined using the characteristic polynomial of the Pell p-numbers and generalized Mersenne numbers. Two algorithms for Diffie-Hellman key exchange are given as an application of these sequences. They are illustrated via numerical examples and shown to be secure against attacks. Thus, these new sequences are practical for encryption and constructing private keys. [ABSTRACT FROM AUTHOR]