The power-generalized k-Horadam sequences in different modules and a new cryptographic method with these sequences

Abstract

In this study, unlike other power sequences, we define new ones in the integer and integer-valued polynomial module. We call these sequences the power-generalized [Formula: see text]-Horadam sequence in the integer module and the power-generalized [Formula: see text]-Horadam sequence in the integer-valued polynomial module. Using these sequences, we rebuild the ElGamal cryptosystem and then obtain a new cryptographic method by combining this and symmetric systems. We provide an encryption example where our method is applied. Finally, we see the advantages of the new cryptographic method when we compare the obtained new cryptographic method with some of the asymmetric cryptographic systems such as RSA and ElGamal. And we achieve that new cryptographic method that has more advantageous.