Skip to main content
SpringerLink
Log in

Hardware Organization to Achieve High-Speed Elliptic Curve Cryptography for Mobile Devices

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Elliptic curve cryptography (ECC) is recognized as a fast cryptography system and has many applications in security systems. In this paper, a novel sharing scheme is proposed to significantly reduce the number of field multiplications and the usage of lookup tables, providing high speed operations for both hardware and software realizations.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Institute for Electrical and Electronics Engineers (IEEE) (2000) Standard 1363-2000. Standard Specifications for Public Key Cryptography, January 2000

  2. Wireless Application Protocol Forum (2007) WAP Wireless Transport Layer Security (WTLS) Specification, http://www1.wapforum.org/tech/documents/WAP-261-WTLS-20010406-a.pdf

  3. Batina L, Guajardo J, Kerins T, Mentens N, Tuyls P, Verbauwhede I (2006) An elliptic curve processor suitable for RFID-tags. (IACR eprint, July 2006) http://eprint.iacr.org/2006/227.pdf

  4. Blake IF, Smart N, Seroussi G (1999) Elliptic curves in cryptography. London mathematical society lecture note series, Cambridge University Press

  5. Chudnovsky DV, Chudnovsky GV (1986) Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv Appl Math 7:385–434

    Article  MATH  MathSciNet  Google Scholar 

  6. Gaudry P, Hess F, Smart N (2000) Constructive and destructive facets of weil descent on elliptic curves. HP Labs Technical Report no. HPL-2000-10. http://www.hpl.hp.com/techreports/2000/HPL-2000-10.html

  7. Hasan MA (2000) Look-up table-based large finite field multiplication in memory constrained cryptosystems. IEEE Trans Comput 49(7):749–758

    Article  MathSciNet  Google Scholar 

  8. Hasan MA (2001) Efficient computation of multiplicative inverses for cryptographic applications. In: Proceedings of the 15th IEEE symposium on computer arithmetic, pp 66–72

  9. Jacobson M, Menezes A, Stein A (2001) Solving elliptic curve discrete logarithm problems using weil descent. Combinatorics and Optimization Research Report, 31 May 2001, http://www.cacr.math.uwaterloo.ca

  10. King B (2001) An improved implementation of elliptic curves over GF(2n) when using projective point arithmetic. Selected areas of cryptography, Springer-Verlag, pp 134–150

  11. King B (2004) A point compression method for elliptic curves defined over GF(2n). Workshop on public key cryptography, pp 333–345

  12. Koblitz N (1987) Elliptic curve cryptosystems. Math Comput 48(177):203–209

    Article  MATH  MathSciNet  Google Scholar 

  13. Leong PHW, Leung IKH (2002) A microcoded elliptic curve processor using FPGA technology. IEEE Trans on Very Large Scale Integr (VLSI) Syst 10(5):550–559, October

    Article  Google Scholar 

  14. Lidl R, Niederreiter H (1997) Finite fields, 2nd edn. Cambridge Univ. Press

  15. Liu S, King B, Wang W (2006) A CRT-RSA algorithm secure against hardware fault attacks. The 2nd IEEE international symposium on dependable, autonomic and secure computing (DASC’06)

  16. Lopez J, Dahab R (1999) Improved algorithms for elliptic curve arithmetic in GF(2n). Selected areas in cryptography ’98, SAC’98. LNCS 1556, Springer, pp 201–212

  17. Messerges TS, Dabbish EA (2003) Digital rights management in a 3G mobile phone and beyond. In: Proceedings of the 3rd ACM workshop on digital rights management, pp 27–38

  18. Miller VS (1985) Use of elliptic curves in cryptography. Advances in cryptology CRYPTO 1985, Springer-Verlag, New York, pp 417–420

    Google Scholar 

  19. Mullin AGR, Vanstone S (1991) On the development of a fast elliptic curve processor chip. Advances in cryptology – crypto ’91, Springer, pp 482–487

  20. Schroeppel R, Orman H, O’Malley SW, Spatscheck O (1995) Fast key exchange with elliptic curve systems. In: Advances in cryptology – CRYPTO ’95. Lecture notes in computer science, vol 963. Springer, pp 43–56

  21. Seroussi G (1998) Compact representation of elliptic curve points over \(F_{2^n}\). HP Labs Technical Reports http://www.hpl.hp.com/techreports/98/HPL-98-94R1.html, pp 1–6

  22. Silverman J (1986) The arithmetic of elliptic curves. Springer, New York

    MATH  Google Scholar 

  23. Singele D, Preneel B (2005) The wireless application protocol (WAP). Int J Netw Secur 1(3):161–165

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ECE Department, Indiana University-Purdue University Indianapolis, Michigan SL 160, Indianapolis, IN, 46202, USA

    Sining Liu, Brian King & Wei Wang

Authors
  1. Sining Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brian King
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Brian King.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, S., King, B. & Wang, W. Hardware Organization to Achieve High-Speed Elliptic Curve Cryptography for Mobile Devices. Mobile Netw Appl 12, 271–279 (2007). https://doi.org/10.1007/s11036-007-0021-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-007-0021-5

Keywords

Search

Navigation