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

Full description

Saved in:
Bibliographic Details
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!
Description
Summary: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 as LUC and LUC3 cryptosystems. All the Lucas based cryptosystems were exposed mathematically to the Lenstra’s attack using Chinese Remainder Theorem and Dickson polynomial. Result shows that the possibility for successful Lenstra’s attack is less against LUC4,6 cryptosystem than LUC3 and LUC cryptosystems. Current study concludes that LUC4,6 cryptosystem is more secure than LUC and LUC3 cryptosystems in sustaining against Lenstra’s attack.