Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29849


Select areas to restrict search in scientific publication database:
10010261
Cryptographic Attack on Lucas Based Cryptosystems Using Chinese Remainder Theorem
Abstract:
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.
Digital Object Identifier (DOI):

References:

[1] D. Bleichenbacher, W. Bosma, and A. K. Lenstra, “Some remarks on Lucas-Based Cryptosystems”, Lecture Notes in Computer Science 963:386-396, 1995.
[2] W. Diffie, and M. Hellman, “New directions in cryptography”, IEEE Transaction on Information Theory 22: 644-654, 1976.
[3] M. Joye, “Security Analysis of RSA-type Cryptosystems”. PhD Thesis, Universite Catholique de Louvain, Belgium, 1997.
[4] M. Joye, “On the importance of securing your bins: The garbage-man-in-the-middle attack”, Proceeding of the 4th ACM Coference on Computer and Communications Security, ACM press, 135-141, 1997.
[5] R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Communication of the ACM 21: 120-126, 1978.
[6] M. R. M. Said, “Application of Recurrence Relations to Cryptography”. PhD Thesis, Macquarie University, Australia, 1997.
[7] M. R. M. Said and L. John, “A Cubic Analogue of the RSA Cryptosystem”, Bulletin of the Australia Mathematical Society 68: 21-38, 2003.
[8] P. J. Smith and M. J. J. Lennon, “LUC: A New Public Key System”, Proceedings of the Ninth IFIP International Symposium on Computer Security: 103-117, 1993.
[9] H. C. Williams, “On a Generalization of the Lucas Functions”, Acta Arithmetica 20: 33-51, 1972.
[10] T. J. Wong, “A RSA-type Cryptosytem Based on Quartic Polynomials”, PhD Thesis, Universiti Putra Malaysia, Malaysia, 2011.
[11] T. J. Wong, M. R. M. Said, K. A. M. Atan, and B. Ural, “The Quartic Analog to the RSA Cryptosystem”, Malaysian Journal of Mathematical Sciences 1(1), 63-81, 2007.
[12] T. J. Wong, M. R. M. Said, M. Othman, and K.A.M. Atan, “Garbage-Man-In-The-Middle Attack on the LUC4 Cryptosystem”, International Journal of Cryptology Research 1(1), 33-41, 2009.
[13] T. J. Wong, M. R. M. Said, M. Othman, and K.A.M. Atan, “GCD Attack on the LUC4 Cryptosystem”, International Journal of Cryptology Research 1(2), 179-189, 2009.
[14] T. J. Wong, H. Kamarulhali, and M. R. M. Said, “On the Hastad's Attack to LUC4,6 Cryptosystem and compared with Other RSA-Type Cryptosystem”. Malaysian Journal of Mathematical Science 7(S), 1-17, 2013.
Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007