Mutual Authentication for Wireless Communication Using Elliptic Curve Digital Signature Based on Pre-known Password

  • Tumpa RoyEmail author
  • Poonam Sisodia
  • Divye Upadhyay
  • Kamlesh Dutta
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 176)


The appearance of public access wireless networks enables ever-present Internet services, whereas it inducing more challenges of security due to open air mediums. As one of the most widely used security mechanisms, authentication is provide for secure communications by preventing unauthorized usage and negotiating credentials for verification. In the intervening time, it generates heavy overhead and delay to communications, further deteriorating overall system performance. First, a system model based on challenge/response authentication mechanism by using the elliptic curve cryptographic digital signature is introduced, which is wide applied in wireless environment to reduce the computational cost, communication bandwidth and the server overload . Then, the concept of security levels is proposed to describe the protection of communications with regard to the nature of security.


Elliptic curve cryptography (ECC) security wireless communication Public key cryptography (PKC) Authentication verification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Krawczyk, H.: HMQV: A High-Performance Secure Diffie-Hellman Protocol. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 546–566. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Bellare, M., Rogaway, P.: Provably Secure Session Key Distribution: The Three Party Case. In: 27th ACM Symposium on the Theory of Computing - ACM STOC, pp. 57–66 (1995)Google Scholar
  3. 3.
    Blake-Wilson, S., Johnson, D., Menezes, A.: Key Agreement Protocols and their Security Analysis. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 30–45. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)Google Scholar
  5. 5.
    Atay, S., Koltuksuz, A., Hışıl, H., Eren, S.: Computational Cost Analysis of Elliptic Curve Aurithmetic. In: International Conference on Brid Information Technology, ICHIT 2006, vol. 1, pp. 578–582 (2006)Google Scholar
  6. 6.
    Chatterjee, K., Gupta, D.: Secure access of smart cards using Elliptic curves Cryptography. In: 5th International Conferences on Wireless Communications, Networking and Mobile Computing, WiCom 2009, pp. 1–4 (2004)Google Scholar
  7. 7.
    Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. London Math. Soc. Lecture Note Series, vol. 265. Cambridge Univ. Press (2000)Google Scholar
  8. 8.
    Aydos, M., Sunar, B., Koç, Ç.K.: An Elliptic Curve Cryptography Based Authentication and Key Agreement Protocol for Wireless Communication. In: 2nd Int. Workshop Discrete Algorithms and Methods for Mobility, DIALM 1998, Dallas, TX (1998)Google Scholar
  9. 9.
    Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Strangio, M.A.: Efficient Diffie-Hellmann Two-Party Key Agreement Protocols based on Elliptic Curves. In: Proceedings of the 2005 ACM Symposium on Applied Computing, pp. 324–331 (2005)Google Scholar
  11. 11.
    Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)Google Scholar
  12. 12.
    Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic curves in cryptography. Cambridge University Press, New York (1999)zbMATHGoogle Scholar
  13. 13.
    Chen, L., Yanpu, C., Zhengzhong, B.: An implementation of fast algorithm for Elliptic Curve Cryptosystem over GF(p). Journal of Electronics 21(4), 346–352 (2004)Google Scholar
  14. 14.
    Morales-Sandoval, M., Feregrino-Uribe, C., Cumplido, R., Algredo-Badillo, I.: An area/performance trade-off analysis of a GF(2m) multiplier architecture for Elliptic Curve Cryptography. Computers and Engineering 35, 54–58 (2009)zbMATHGoogle Scholar
  15. 15.
    Smart, N.P.: The discrete logarithm problem on elliptic curves of trace one. Journal of Cryptology 12(3), 193–196 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Lin, X., Wong, J.W., Kou, W.: Performance analysis of secure web server based on SSL, pp. 249–261. Springer, Heidelberg (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Tumpa Roy
    • 1
    Email author
  • Poonam Sisodia
    • 1
  • Divye Upadhyay
    • 1
  • Kamlesh Dutta
    • 2
  1. 1.GLNA Institute of TechnologyMathureIndia
  2. 2.National Institute of Technology HamirpurHamirpurIndia

Personalised recommendations