Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack

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’...

Full description

Bibliographic Details
Main Authors: Tze, Jin Wong, Lee, Feng Koo, Pang, Hung Yiu
Format: Article
Language:English
Published: International Knowledge Press 2018
Online Access:http://psasir.upm.edu.my/id/eprint/74866/
http://psasir.upm.edu.my/id/eprint/74866/1/Lucas%20based.pdf
_version_ 1848857566769053696
author Tze, Jin Wong
Lee, Feng Koo
Pang, Hung Yiu
author_facet Tze, Jin Wong
Lee, Feng Koo
Pang, Hung Yiu
author_sort Tze, Jin Wong
building UPM Institutional Repository
collection Online Access
description 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
first_indexed 2025-11-15T11:59:36Z
format Article
id upm-74866
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T11:59:36Z
publishDate 2018
publisher International Knowledge Press
recordtype eprints
repository_type Digital Repository
spelling upm-748662020-03-17T08:14:51Z http://psasir.upm.edu.my/id/eprint/74866/ Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack Tze, Jin Wong Lee, Feng Koo Pang, Hung Yiu 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 International Knowledge Press 2018 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/74866/1/Lucas%20based.pdf Tze, Jin Wong and Lee, Feng Koo and Pang, Hung Yiu (2018) Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack. Asian Journal of Mathematics and Computer Research, 23 (4). 207 - 213.
spellingShingle Tze, Jin Wong
Lee, Feng Koo
Pang, Hung Yiu
Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
title Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
title_full Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
title_fullStr Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
title_full_unstemmed Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
title_short Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
title_sort lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
url http://psasir.upm.edu.my/id/eprint/74866/
http://psasir.upm.edu.my/id/eprint/74866/1/Lucas%20based.pdf