Skip to main content
SpringerLink
Log in

Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves

  • Conference paper
Cryptography and Coding (IMACC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7089))

Included in the following conference series:

Abstract

Precomputation is essential for window-based scalar multiplications which are the most important operation of elliptic curve cryptography. This precomputation stage may require a significant amount of time due to the expensive inversions over finite fields of large characteristic. Hence, the existing state-of-the-art precomputation schemes try to reduce the number of inversions as much as possible. However, our analysis show that the performance of precomputation schemes not only depends on the cost of field inversions, but also on the cost ratio of inversion to multiplication (i.e. I/M).

In this paper, we present a new scheme to precompute all odd multiples [3]P, …, [2k − 1]P, k ≥ 2 on standard elliptic curves in affine coordinates. Our precomputation scheme strikes a balance between the number of inversions and multiplications. We show that our scheme requiring only 2(k − 1) registers, offers the best performance in the case of k ≥ 8 if the I/M-ratio is around 10.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acar, T., Lauter, K., Naehrig, M., Shumow, D.: Affine Pairings on ARM. Cryptology ePrint Archive, Report 2011/243 (2011), http://eprint.iacr.org/

  2. Brown, M., Hankerson, D., López, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves Over Prime Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 250–265. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Ciet, M., Joye, M., Lauter, K., Montgomery, P.: Trading inversions for multiplications in elliptic curve cryptography. Designs, Codes and Cryptography 39, 189–206 (2006), doi:10.1007/s10623-005-3299-y

    Article  MATH  MathSciNet  Google Scholar 

  4. Cohen, H.: A course in computational algebraic number theory. Springer-Verlag New York, Inc., New York (1993)

    Book  MATH  Google Scholar 

  5. Cohen, H.: Analysis of the sliding window powering algorithm. Journal of Cryptology 18, 63–76 (2005), doi:10.1007/s00145-004-0218-8

    Article  MATH  MathSciNet  Google Scholar 

  6. Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation using Mixed Coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 51–65. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Dahmen, E., Okeya, K., Schepers, D.: Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 245–258. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer-Verlag New York, Inc., Secaucus (2003)

    MATH  Google Scholar 

  9. Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48(177), 203–209 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Le, D.-P.: Fast Quadrupling of a Point in Elliptic Curve Cryptography. Cryptology ePrint Archive, Report 2011/039 (2011), http://eprint.iacr.org/

  11. Longa, P., Gebotys, C.: Novel Precomputation Schemes for Elliptic Curve Cryptosystems. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 71–88. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Longa, P., Miri, A.: New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 229–247. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Meloni, N.: New Point Addition Formulae for ECC Applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 189–201. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. 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 

  15. Okeya, K., Sakurai, K.: Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy using Montgomery Trick. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 564–578. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Okeya, K., Takagi, T., Vuillaume, C.: Efficient Representations on Koblitz Curves with Resistance to Side Channel Attacks. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 218–229. Springer, Heidelberg (2005), doi:10.1007/11506157_19

    Chapter  Google Scholar 

  17. Scott, M.: New record breaking implementations of ECC on quadratic extensions using endomorphisms. In: Invited talk at the 12th Workshop on Elliptic Curve Cryptography, ECC 2008 (2008)

    Google Scholar 

  18. Seysen, M.: Using an RSA Accelerator for Modular Inversion. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 226–236. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Temasek Laboratories, National University of Singapore, Singapore

    Duc-Phong Le & Chik How Tan

Authors
  1. Duc-Phong Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chik How Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hewlett-Packard Laboratories, UK

    Liqun Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le, DP., Tan, C.H. (2011). Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves. In: Chen, L. (eds) Cryptography and Coding. IMACC 2011. Lecture Notes in Computer Science, vol 7089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25516-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25516-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25515-1

  • Online ISBN: 978-3-642-25516-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation