Advertisement

A New Technique to Improve the Security of Elliptic Curve Encryption and Signature Schemes

  • Tun Myat AungEmail author
  • Ni Ni HlaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11814)

Abstract

Elliptic curve encryption and signature schemes are nowadays widely used in public communication channels for network security services. Their security depends on the complexity of solving the Elliptic Curve Discrete Logarithm Problem. But, there are several general attacks that are vulnerable to them. The paper includes how to put into practice of complex number arithmetic in prime field and binary field. Elliptic curve arithmetic is implemented over complex fields to improve the security level of elliptic curve cryptosystems. The paper proposes a new technique to implement elliptic curve encryption and signature schemes by using elliptic curves over complex field. The security of elliptic curve cryptosystems is greatly improved on implementing an elliptic curve over complex field. The proposed technique requires double the memory space to store keys but the security level is roughly squared.

Keywords

Complex field Elliptic curve Encryption Implementation Signature Security 

References

  1. 1.
    Aung, T.M., Hla, N.N.: Implementation of elliptic curve arithmetic operations for prime field and binary field using java BigInteger class. Int. J. Eng. Res. Technol. (IJERT) 6(08), 454–459 (2017).  https://doi.org/10.17577/ijertv6is080211CrossRefGoogle Scholar
  2. 2.
    Forouzan, B.A.: Elliptic curve cryptosystems. In: Cryptography and Network Security, International Edition, pp. 321–330. McGraw-Hill Press, Singapore (2008)Google Scholar
  3. 3.
    Forouzan, B.A.: Mathematics of cryptography. In: Cryptography and Network Security, International Edition, pp. 98–117. McGraw-Hill Press, Singapore (2008)Google Scholar
  4. 4.
    Hankerson, D., Menezes, A., Vanstone, S.: Elliptic curve arithmetic. In: Guide to Elliptic Curve Cryptography, pp. 75–152. Springer, New York (2004).  https://doi.org/10.1007/0-387-21846-7_3
  5. 5.
    Hla, N.N., Aung, T.M.: Implementation of finite field arithmetic operations for large prime and binary fields using java BigInteger class. Int. J. Eng. Res. Technol. (IJERT) 6(08), 450–453 (2017).  https://doi.org/10.17577/ijertv6is080209CrossRefGoogle Scholar
  6. 6.
    Hla, N.N., Aung, T.M.: Attack experiments on elliptic curves of prime and binary fields. In: Abraham, A., Dutta, P., Mandal, J.K., Bhattacharya, A., Dutta, S. (eds.) Emerging Technologies in Data Mining and Information Security. AISC, vol. 755, pp. 667–683. Springer, Singapore (2019).  https://doi.org/10.1007/978-981-13-1951-8_60CrossRefGoogle Scholar
  7. 7.
    Hla, N.N., Aung, T.M.: Experiments on implementation of elliptic curve arithmetic over complex fields using java BigInteger Class. J. Commun. (JCM) 14(4), 293–300 (2019).  https://doi.org/10.12720/jcm.14.4.293-300CrossRefGoogle Scholar
  8. 8.
    Kreyszig, E.: Complex numbers and their geometric representation. In: Advanced Engineering Mathematics, 10th edn, pp. 608–612. Wiley, New York (2011)Google Scholar
  9. 9.
    Mohamed, E., Elkamchouchi, H.: Elliptic curve cryptography over Gaussian integers. Int. J. Comput. Sci. Netw. Secur. 4(1), 413–416 (2009)Google Scholar
  10. 10.
    Rosen, K.H.: Number theory and cryptography. In: Discrete Mathematics and its Applications, 7th edn., pp. 237–294. McGraw-Hill Press, New York (2011)Google Scholar
  11. 11.
    Rabah, K.: Elliptic Curve ElGamal Encryption and Signature Schemes. Inf. Technol. J. 4(3), 299–306 (2005)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.University of Computer StudiesYangonMyanmar

Personalised recommendations