Cryptographic Attack on Lucas Based Cryptosystems Using Chinese Remainder Theorem

International Journal of Information Technology

Tze Jin Wong ; Lee Feng Koo ; Pang Hung Yiu

关键词: Lucas sequence;    Dickson Polynomial;    faulty signature;    corresponding signature;    congruence.;   

DOI  :  10.1999/1307-6892/10010261

学科分类：计算机应用

来源: World Academy of Science, Engineering and Technology (W A S E T)

【 摘 要 】

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.

【 授权许可】

Unknown