Skip to main content
Log in

An efficient ECDSA-based signature scheme for wireless networks

  • Security of Network and Communication
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Wired equivalent security is difficult to provide in wireless networks due to high dynamics, wireless link vulnerability, and decentralization. The Elliptic Curve Digital Signature Algorithm (ECDSA) has been applied to wireless networks because of its low computational cost and short key size, which reduces the overheads in a wireless environment. This study improves the ECDSA scheme by reducing its time complexity. The significant advantage of the algorithm is that our new scheme needs not to calculate modular inverse operation in the phases of signature generation and signature verification. Such an improvement makes the proposed scheme more efficient and secure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Menezes A, Vanstone S, Oorschot V.Handbook of Applied Cryptography[M]. Boca Raton: CRC Press, 2001: 283–320.

    Google Scholar 

  2. Rivest R, Shamir A, Adleman L. A Method for Obtaining Digital Signatures and Public Key Cryptosystems[J].Communications of the ACM, 1978,21(2):120–126.

    Article  MATH  MathSciNet  Google Scholar 

  3. Koblitz N.A Course in Number Theory and Cryptography [M]. New York: Springer-Verlag, 1994: 167–191.

    Google Scholar 

  4. Nicholas J, Brandon A. Performance Comparison of Elliptic Curve and RSA Digital Signatures[EB/OL]. [2005-09-01].http://www.nicj.net/files/498termpaper.pfd.

  5. Johnson D, Menezes A, Vanstone S. The Elliptic Curve Digital Signature Algorithm (ECDSA) [J].International Journal on Information Security, 2001,1(1): 36–63.

    Google Scholar 

  6. Koblitz N, Menezes A, Vanstone S. The State of Elliptic Curve Cryptography [J].Designs Codes and Cryptography, 2000,19: 173–193.

    Article  MATH  MathSciNet  Google Scholar 

  7. Lawrence C.Elliptic Curves: Number Theory and Cryptography[M]. Boca Raton: CRC Press, 2003: 9–59.

    Google Scholar 

  8. Jurisic A, Menezes A. Elliptic Curves and Cryptography [EB/OL]. [2003-04-02].http://www.certicom. com/whitepapers.

  9. Blake I, Seroussi G, Smart N.Elliptic Curves in Cryptography[M]. Cambridge: Cambridge University Press, 1999: 57–76.

    Google Scholar 

  10. Menezes A, Okamoto T, Vastone S. Reducing Elliptic Curve Logarithms to a Finite Field [J].IEEE Trans Info Theory, 1983,39: 1636–1646.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dai Guanzhong.

Additional information

Foundation item: Supported by the Science Foundation of Aeronautics (05F53029) and Graduate Starting Seed Fund of Northwestern Polytechnical, University (Z200633)

Biography: XU Zhong (1979-), male, Ph. D. candidate, research direction: information security, Ad hoc networks.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhong, X., Guanzhong, D. & Deming, Y. An efficient ECDSA-based signature scheme for wireless networks. Wuhan Univ. J. Nat. Sci. 11, 1707–1710 (2006). https://doi.org/10.1007/BF02831856

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02831856

Key words

CLC number

Navigation