Message Mapping Technique Using Elliptic Curve Cryptosystem

P  L Sharma; Shalini Gupta; Kritika  Gupta; Ashim; Sushil Kumar

doi:10.48165/

Authors

P L Sharma Department of Mathematics & Statistics, Himachal Pradesh University, Summer Hill, Shimla - 171005, India
Shalini Gupta Department of Mathematics & Statistics, Himachal Pradesh University, Summer Hill, Shimla - 171005, India
Kritika Gupta Department of Mathematics & Statistics, Himachal Pradesh University, Summer Hill, Shimla - 171005, India
Ashim Department of Mathematics & Statistics, Himachal Pradesh University, Summer Hill, Shimla - 171005, India
Sushil Kumar Department of Mathematics & Statistics, Himachal Pradesh University, Summer Hill, Shimla - 171005, India

DOI:

https://doi.org/10.48165/

Keywords:

Elliptic curve cryptography, Encryption, Decryption, Mapping Schemes, Cryptanalysis

Abstract

There are several mapping techniques to map the characters of the message to points on an elliptic curve using Elliptic Curve Cryptography. In the present paper, we propose a new mapping technique based on XOR operation. This mapping technique helps us in mapping the three characters simultaneously to a single point on an elliptic curve without the need of Code Table.

References

Amounas, F. and Kinani, E. H. El (2012). Fast mapping method based on matrix approach for elliptic curve cryptography, International Journal of Information & Network Security, 1(2), 54-59.

Bh, P.,Chandravathi, D. and Prapoorna, R. P. (2010). Encoding and decoding of a message in the implementation of elliptic curve cryptography using Koblitz’s Method, International Journal on Computer Science and Engineering, 2(5).

Hankerson, D., Menezes, A. J. and Vanstone, S. (2004). Guide to Elliptic Curve Cryptography, Springer Professional Computing (1st ed.), Springer -Verlag New York.

Johnston, A. M. and Gemmell, P. S. (2002). Authenticated key exchange provably secure against the man in-middle attack, Journal of Cryptology, 2, 139-148.

Koblitz, N. (1987). Elliptic curve cryptosystem, Mathematics of Computation, 48(177), 203-209. 6. Koblitz, N., Menezes, A. J. and Vanstone, S. (2000). The State of elliptic curve cryptography, Design, Codes and Cryptography, 19, 173-193.

Kumar, D. S., Suneetha, CH. and Chandrasekhar, A. (2012). Encryption of data using elliptic curve over finite fields, International Journal of Distributed and Parallel Systems (IJDPS), 3, 301-308. 8. Lidl, R. and Niederreiter, H. (1983). Finite fields, Encyclopedia of Mathematics and its Applications, Addison Wesley, Reading, MA. 20.

Miller, V. S. (1986). Uses of elliptic curves in cryptography, In Advances in Cryptology CRYPTO’85 Proceedings, Crypto 1985, 218, 417-426.

Mullen, G. L. and Panario, D. (2013). Handbook of Finite Fields (1st ed.), Chapman and Hall/CRC. 11. Muthukuru, J. and Sathyanarayana, B. (2012). Fixed and variable size text based message mapping techniques using ECC, Global Journal of Computer Science and Technology, 12(3) 12-18. 12. Sharma, P. L., Gupta, K., Badoga, N. K. and Ashima (2021). A new mapping scheme using elliptic curve cryptography, The Journal of Oriental Research Madras, XCII-LXXVIII, 38-48.

Silverman, J. H. (2009). The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, 106. 14. Singh, L. D. and Singh, K. M. (2015). Implementation of text encryption using elliptic curve cryptography, Procedia Computer Science, 54, 73-82.

Trappe, W. and Washington, L. C. (2006). Introduction to Cryptography with Coding Theory (2nd ed.), Prentice Hall: New Jersey.

Washington, L. C. (2008). Elliptic Curves Number Theory and Cryptography (2nd ed.), Chapman and Hall/CRC.