Public Key Cryptosystem Based on Polynomial Composition

Maxrizal Maxrizal; Baiq Desy Aniska Prayanti

doi:10.31002/ijome.v2i2.1813

Public Key Cryptosystem Based on Polynomial Composition

Maxrizal Maxrizal, Baiq Desy Aniska Prayanti

Abstract

The public key cryptosystem is an extension of an asymmetric key cryptosystem. The public key cryptosystems have been developed based on the concepts of matrix, polynomial and polynomial decomposition. In this study, we will introduce the public key cryptosystem over polynomial composition. This research is a literature study. The results show that the polynomial composition can be used in public-key cryptosystems by modifying special functions to apply commutative properties.

Keywords

polynomial composition, polynomial key, the public key cryptosystem

Full Text:

PDF

References

Andrecut, M. (2015). A matrix public key cryptosystem, 1–18.

Anjaneyulu, G. S. G. N., & Sanyasirao, A. (2014). Distributed group key management protocol over non-commutative division semirings. Indian Journal of Science and Technology, 7(6), 871–876.

Anton, H., & Rorres, C. (2013). Elementary linear algebra: Applications version, 11th Edition. Wiley eGrade.

Dwivedi, A., Ojha, D. B., Sharma, A., & Mishra, A. (2011). A model of key agreement protocol using polynomials over non-commutative division semirings. Journal of Global Research in Computer Science, 2(3), 40–43.

Ezhilmaran, D., & Muthukumaran, V. (2016). Key exchange protocol using decomposition problem in near ring. Gazi University Journal of Science, 29(1), 123–127.

Lang, S. (1993). Linear algebra. New York: Springer.

Liu, J., Zhang, H., & Jia, J. (2017). Cryptanalysis of schemes based on polynomial symmetrical decomposition. Chinese Journal of Electronics, 26(6), 1139–1146.

https://doi.org/10.1049/cje.2017.05.005

Liu, J., Zhang, H., Jia, J., Wang, H., Mao, S., & Wu, W. (2016). Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem. Science China. Information Sciences, 59(May), 1–11. https://doi.org/10.1007/s11432-015-5443-2

Tsaban, B. (2015). Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography. Journal of Cryptology, 28(3), 601–622. https://doi.org/10.1007/s00145-013-9170-9

Valluri, M. R. (2014). Zero-knowledge authentication schemes using quasi-polynomials over non-commutative groups. Open Journal of Information Security And Applications, 1(1), 43–50.

DOI: https://doi.org/10.31002/ijome.v2i2.1813