An RSA cryptosystem based on Lehmer sequences in Some classes of groups
Elahe Mehraban, Thomas Aaron Gulliver, Evren Hınçal · Advances in Mathematics of Communications · 2024
In this paper, we consider the well-known Lehmer sequence and obtain the Lehmer orbit of some special groups of nilpotency class $ 2 $. The period of the Lehmer sequences in these groups is studied and shown to be a multiple of the period of the Lehmer orbits. Then, three RSA algorithms are presented using the Lehmer sequences and Lehmer orbits of groups. This is the first application of these sequences and orbits in cryptography. The security of the algorithms is also examined.