Cryptographic attack on Lucas based cryptosystems using chinese remainder theorem
Lenstra’s attack uses Chinese remainder theorem as a tool and requires a faulty signature to be successful. This paper reports on the security responses of fourth and sixth order Lucas based (LUC4,6) cryptosystem under the Lenstra’s attack as compared to the other two Lucas based cryptosystems such...
Saved in:
Main Authors: | Wong, Tze Jin, Lee, Feng Koo, Pang, Hung Yiu |
---|---|
Format: | Article |
Language: | English |
Published: |
World Academy of Science Engineering and Technology
2019
|
Online Access: | http://psasir.upm.edu.my/id/eprint/81055/1/LUCAS.pdf http://psasir.upm.edu.my/id/eprint/81055/ https://publications.waset.org/10010261/cryptographic-attack-on-lucas-based-cryptosystems-using-chinese-remainder-theorem |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the wiener's attack into lucas based El-gamal cryptosystem in the elliptic curve over finite field
by: Wong, Tze Jin, et al.
Published: (2018) -
Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
by: Tze, Jin Wong, et al.
Published: (2018) -
An analysis for chosen plaintext attack in elliptic curve cryptosystem based on second order lucas sequence
by: Koo, Lee Feng, et al.
Published: (2019) -
Cryptographic attack on LUC-type cryptosystems using GMITM (Type 1)
by: Sarbini, Izzatul Nabila, et al.
Published: (2019) -
Common modulus attack against Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field
by: Koo, Lee Feng, et al.
Published: (2018)