Design of public key cryptosystem based on the underlying mathematical complexity
*Pauly J.Corresponding authorjincy.pauly@gmail.comDepartment of Mathematics St. Thomas College (Autonomous) Affiliated to University of CalicutThrissur, Kerala, 680001, India0000-0003-1647-1029View full profile → , Saju M Isajumambilly@gmail.comDepartment of Mathematics St. Thomas College (Autonomous) Affiliated to University of CalicutThrissur, Kerala, 680001, IndiaView full profile → , Renjith Vargheserenjithvarghese8@gmail.comDepartment of Mathematics St. Thomas College (Autonomous) Affiliated to University of CalicutThrissur, Kerala, 680001, KeralaView full profile → , Antony John E Fantonyjohnef@gmail.comDepartment of Mathematics St. Thomas College (Autonomous) Affiliated to University of CalicutThrissur, Kerala, 680001, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 16 Jul 2024
- Published Online:
- 11 Apr 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2239
- Pages:
- 973–979
Abstract
Keywords
Subject Classifications
References
[1] R. Rivest, “RSA (cryptosystem),” Arithmetic Algorithms and Applications (1977).
[2] T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, pp. 469–472 (1985).
[3] W. Diffie, “Diffie-Hellman Key Exchange,” (1976).
[4] P. K. Panda and S. Chattopadhyay, “A hybrid security algorithm for RSA cryptosystem,” in 2017 4th International Conference on Advanced Computing and Communication Systems (ICACCS), pp. 1–6, IEEE (2017).
[5] B. P. U. Ivy, P. Mandiwa, and M. Kumar, “A modified RSA cryptosystem based on ‘n’ prime numbers,” International Journal of Engineering And Computer Science, vol. 1, pp. 63–66 (2012).
[6] T. Takagi, “Fast RSA-type cryptosystem modulo pkq,” in Advances in Cryptology—CRYPTO’98: 18th Annual International Cryptology Conference Santa Barbara, California, USA August 23–27, 1998 Proceedings, pp. 318–326, Springer (1998).
[7] S. Aikins-Bekoe and J. B. Hayfron-Acquah, “Elliptic curve diffie-hellman (ECDH) analogy for secured wireless sensor networks,” International Journal of Computer Applications, vol. 176, pp. 1–8 (2020).
[8] S. M. I., R. Varghese, and E. F. A. John, “A design of public key Cryptosystem in an algebraic extension field over a finite field using the difficulty of solving DLP,” Malaya Journal of Matematik (MJM), vol. 8, pp. 459–463 (2020), doi: 10.26637/MJM0802/0022.
[9] A. Mahalanobis, “Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups,” Florida Atlantic University (2005).
[10] S. Irawadi, “Discrete Logarithmic Improvement for ElGamal Cryptosystem Using Matrix Concepts,” in 2020 8th International Conference on Cyber and IT Service Management (CITSM), pp. 1–5, IEEE (2020).
[11] M. Maxrizal and B. D. A. Prayanti, “A New Method of Hill Cipher: The Rectangular Matrix As The Private Key,” in 2nd International Conference on Science and Technology for Sustainability Proceeding, p. 81 (2016).
[12] P. Sundarayya and G. Vara Prasad, “A public key cryptosystem using Affine Hill Cipher under modulation of prime number,” Journal of Information and Optimization Sciences, vol. 40, no. 4, pp. 919–930 (2019), doi: 10.1080/02522667.2018.1470751.
[13] N. Tahat, A. K. Alomari, O. M. Al-Hazaimeh, and M. F. Al-Jamal, “An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 23, no. 4, pp. 935–948 (2020), doi: 10.1080/09720529.2020.1734293.
[14] R. Lidl and H. Niederreiter, Finite Fields. Cambridge University Press, Cambridge (1996).
[15] S. M. I., J. Pauly, R. Varghese, and A. John E. F., “Primitive-Polynomial-Based Secure Cryptosystem Under the Difficulty of DLP,” Bulletin of the Calcutta Mathematical Society, vol. 116, no. 3, pp. 333-340 (2024).
