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

WONG, TZE JIN and KOO, LEE FENG and YIU, PANG HUNG (2018) LUCAS BASED EL-GAMAL CRYPTOSYSTEM IN THE ELLIPTIC CURVE GROUP OVER FINITE FIELD UNDER LENSTRA’S ATTACK. Asian Journal of Mathematics and Computer Research, 23 (4). pp. 207-213.

Full text not available from this repository.

Abstract

This paper reports on a Lenstra’s attack against the Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field. Lenstra’s attack is an attack to recover the secret factor of the order of elliptic curve group from a faulty signature. Results show that the success of the Lenstra’s attack depend on cryptographic algorithm implementation practice rather than the weakness of the cryptosystem itself.

Item Type: Article
Subjects: Open Research Librarians > Mathematical Science
Depositing User: Unnamed user with email support@open.researchlibrarians.com
Date Deposited: 06 Jan 2024 03:33
Last Modified: 06 Jan 2024 03:33
URI: http://stm.e4journal.com/id/eprint/2294

Actions (login required)

View Item
View Item