Advertisement

New Password Embedding Technique Using Elliptic Curve Over Finite Field

  • D. Sravana Kumar
  • C. H. SuneethaEmail author
  • P. Sirisha
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 906)

Abstract

In the present sophisticated digital era, safe communication of user password from one source to the other is quite difficult in client/server system. Also storing the password as it appears increases the potential risk of the security. Protection of the password is at most important in group communications to avoid the access of the illegal person to group resources. In addition, a roaming user who uses the network from different client terminals requires access to the private key. The present paper explains secure communication of password from one entity to the other. Here the password is encrypted using elliptic curve over finite field, embedded in a large random text at different selected positions, and communicated to the receiver via public channel.

Keywords

Encryption Decryption Elliptic curve over finite field 

References

  1. 1.
    Ku, W. C., & Wang, S. D. (2000). Cryptanalysis of modified authenticated key agreement protocol. Electronic Letters, 36(21), 1770–1771.CrossRefGoogle Scholar
  2. 2.
    Aziz, A., & Diffie, W. (1994). A secure communications protocol to prevent unauthorized access: Privacy and authentication for wireless local area networks. In IEEE Personal Communications, pp. 25–31, first quarter.Google Scholar
  3. 3.
    Aydos, M., Sunar, B., & Koc, C. K. (1998). An elliptic curve cryptography based on authentication and key agreement protocol for wireless communications. http://www.researchgate.net.
  4. 4.
    Lee, C.-Y., Wang, Z.-H., Harn, L., & Chang, C.-C. (2011). Secure key transfer protocol based on secret sharing for group communications. IEICE Transactions, 94-D(11), 2069–2076.Google Scholar
  5. 5.
    Diffie, W., & Hellman, M. E. (1976). New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6), 644–654.Google Scholar
  6. 6.
    Washington, L. C. (2008). Elliptic curves: Number theory and cryptography (2nd ed.). Boca Raton, FL: Chapman and Hall.CrossRefGoogle Scholar
  7. 7.
    Baalghusun, A. O., Abusalem, O. F., Al Abbas, Z. A., & Kar, J. (2015). Authenticated key agreement protocols: A comparative study. Journal of Information Security, 6, 51–58.CrossRefGoogle Scholar
  8. 8.
    Juels, A., Molnar, D., & Wagner, D. (2005). Security and privacy issues in E-passports. In IEEE SecureComm’05, pp. 74–88.Google Scholar
  9. 9.
    Black, U. (2009). “Other key security protocols” book. Teach yourself networking in 24 hours, 332p.Google Scholar
  10. 10.
    Bellare, M., Kilian, J., & Rogaway, P. (2000). The Security of the cipher block chaining message authentication code. Journal of Computer and System Sciences, 61, 362–399.MathSciNetCrossRefGoogle Scholar
  11. 11.
    Perrig, A. (1999). Efficient collaborative key management protocols for secure autonomous group communications. http://semanticscholar.org/18a4/025717de52e3981d67dd710a05ba2c926d2.pdf.
  12. 12.
    Burmster, M., & Desmedt, V.O. (1994). A secure and efficient conference key distribution system. In A. De Santis (Ed.), EUROCRYPT 94, LNCS 950, pp. 275–286.Google Scholar
  13. 13.
    Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics Computation, 48(177), 203–209.MathSciNetCrossRefGoogle Scholar
  14. 14.
    Miller, V. (1985). Uses of elliptic curves in cryptography. In Advances in Cryptography (CRYPTO 1985), Springer LNCS, Vol. 218, pp. 417–426.Google Scholar
  15. 15.
    Maurer, U., Menzes, A., & Teske, E. (2002). Analysis of GHS weil decent attack on the ECDLP over characteristic two fields of composite degree. LMS Journal of Computation and Mathematics, 5, 127–174.MathSciNetCrossRefGoogle Scholar
  16. 16.
    Menzes, A., & Vanstone, S. (1997). Hand book of applied cryptography. In The CRC-Press Series of Discrete Mathematics and its Applications. CRC-Press.Google Scholar
  17. 17.
    Blumenfeld, A. (2011). Discrete logarithms on elliptic curves.Google Scholar
  18. 18.
    Miyaji, N., & Takano, S. (2006). Elliptic curves with low embedding degree. Journal of Cryptology, 19(4), 553–562.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • D. Sravana Kumar
    • 1
  • C. H. Suneetha
    • 2
    Email author
  • P. Sirisha
    • 3
  1. 1.Dr. V. S. Krishna Government Degree CollegeVisakhapatnamIndia
  2. 2.GITAM UniversityVisakhapatnamIndia
  3. 3.Faculty in MathematicsIndian Maritime UniversityVisakhapatnamIndia

Personalised recommendations