TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

A novel approach for Menezes-Vanstone elliptic curve cryptosystem

* ,

* Corresponding author · click or hover a name for details

pp. 981–990Vol. 28Issue 3April 2025DOI: 10.47974/JDMSC-2257 Crossmark XML
Received:
21 Feb 2024
Published Online:
18 Apr 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2257
Pages:
981–990

Abstract

Cryptographic algorithms are widely used to safeguard data and information over the internet. One of the most efficient technique used for this purpose is the Elliptic Curve Cryptosystem (ECC) which recently gained a lot of interest due to its high performance. It is based upon the hardness of Elliptic Curve Discrete Logarithmic Problem (ECDLP) and till date there is no efficient algorithm that can solve the problem in polynomial time. In this paper an innovative algorithm for ``Menezes-Vanstone Elliptic curve cryptosystem (MVECC)’’ have been proposed to make it more efficient. In comparison to the original algorithm, the proposed algorithm has no inverse operation making it faster and less computationally complex. 

Keywords

Subject Classifications

11G0711T71

References

[1] O. A. Imran, S. F. Yousif, I. S. Hameed, W. N. A. D. Abed, and A. T. Hammid, “Implementation of el-gamal algorithm for speech signals encryption and decryption,” Procedia Computer Science, vol. 167, pp. 1028–1037 (2020).
[2] V. S. Miller, “Use of elliptic curves in cryptography,” in Conference on the theory and application of cryptographic techniques, pp. 417–426, Springer (1985).
[3] N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of computation, vol. 48, no. 177, pp. 203–209 (1987).
[4] D. Dachman-Soled, J. Loss, and A. O’Neill, “Breaking rsa generically is equivalent to factoring, with preprocessing,” Cryptology ePrint Archive (2022).
[5] D. S. Sakkari and M. M. ulla, “Review on insight into elliptic curve cryptography,” in Modern Approaches in Machine Learning & Cognitive Science: A Walkthrough, pp. 81–93, Springer (2022).
[6] E. B. Barker, W. C. Barker, W. E. Burr, W. T. Polk, and M. E. Smid, “Recommendation for key management, part 1: General (revision 3),” (2006).
[7] S. S. Dhanda, B. Singh, and P. Jindal, “Demystifying elliptic curve cryptography: Curve selection, implementation and countermeasures to attacks,” Journal of Interdisciplinary Mathematics, vol. 23, no. 2, pp. 463–470 (2020).
[8] Q. M. Luhaib and R. K. K. Ajeena, “Elliptic curve matrices over group ring to improve elliptic curve–discrete logarithm cryptosystems,” Journal of Discrete Mathematical Sciences & Cryptography, vol. 26, no. 6, pp. 1699–1704 (2022).
[9] A. J. Menezes and S. A. Vanstone, “Elliptic curve cryptosystems and their implementation,” Journal of cryptology, vol. 6, pp. 209–224 (1993).
[10] W. Stallings, Cryptography and network security, 4/E. Pearson Education India, 2006.
[11] A. M. Sagheer, “Elliptic curves cryptographic techniques,” in 2012 6th International Conference on Signal Processing and Communication Systems, pp. 1–7, IEEE (2012).
[12] N. H. Al-Saffar, M. R. M. Said, and M. Rushdan, “On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems,” International Journal of Cryptology Research, vol. 4, no. 1, pp. 42–54 (2013).
[13] K. Meltem and Y. Tarik, “A new modified cryptosystem based on menezes vanstone elliptic curve cryptography algorithm that uses characters hexadecimal values,” in 2013 The International Conference on Technological Advances in Electrical, Electronics and Computer Engineering, pp. 449–453, IEEE (2013).
[14] A. T. Sadiq and N. J. Kadhim, “Enhanced menezes-vanestone elliptic curves cryptosystem,” Al Nahrain Journal of Science, vol. 12, no. 1, pp. 162–165 (2009).
[15] D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to elliptic curve cryptography. Springer Science & Business Media (2004).
[16] G. Barwood, “Elliptic curve cryptography faq v1. 12 22nd,” (1997).
[17] H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, and F. Vercauteren, Handbook of elliptic and hyperelliptic curve cryptography. CRC press (2005).
[18] J. H. Silverman, The arithmetic of elliptic curves, vol. 106. Springer (2009).
[19] L. C. Washington, Elliptic curves: number theory and cryptography. Chapman and Hall/CRC (2008).
[20] A. K. Bhandari, D. Nagaraj, B. Ramakrishnan, and T. Venkataramana, Elliptic curves, modular forms and cryptography: proceedings of the Advanced Instructional Workshop on Algebraic Number Theory. Springer (2003).
[21] L. Chen, D. Moody, A. Regenscheid, and K. Randall, “Recommendations for discrete logarithmbased cryptography: Elliptic curve domain parameters,” tech. rep., National Institute of Standards and Technology (2019).

Views: 137Downloads: 4Citations: 0