LUCAS BASED EL-GAMAL CRYPTOSYSTEM IN THE ELLIPTIC CURVE GROUP OVER FINITE FIELD UNDER LENSTRA’S ATTA

In the elliptic curve group over finite field, this work describes a Lenstra's attack against the Lucas-based El-Gamal Cryptosystem. The Lenstra attack is a method for recovering the secret factor of the elliptic curve group's order from a flawed signature. The results reveal that the Lenstra attack's success is determined by cryptographic algorithm implementation practise rather than the cryptosystem's weakness.

Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/945