Skip to main content
SpringerLink
Log in

Speeding Up Elliptic Scalar Multiplication with Precomputation

  • Conference paper
Information Security and Cryptology - ICISC’99 (ICISC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1787))

Included in the following conference series:

Abstract

It is often required in many elliptic curve cryptosystems to compute kG for a fixed point G and a random integer k. In this paper we present improved algorithms for such elliptic scalar multiplication. Implementation results on Pentium II and Alpha 21164 microprocessors are also provided to demonstrate the presented improvements in actual implementations.

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. Bailey, D.V., Paar, C.: Optimal extension field for fast arithmetic in public key algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 472–485. Springer, Heidelberg (1998)

    Google Scholar 

  2. Bailey, D.V., Paar, C.: Inversion in Optimal Extension Fields. In: presented at The Mathematics of Public-Key Cryptography (June 1999) (see also Elliptic curve cryptosystems over large characteristic extension fields by the same authors, preprint, 1999)

    Google Scholar 

  3. Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 200–207. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  4. Cheon, J.H., Park, S.M., Park, S.W., Kim, D.H.: Two efficient algorithms for arithmetic of elliptic curves using Frobenius map. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 195–202. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Cohen, H.: A course in computational number theory. Graduate Texts in Math, vol. 138. Springer, Heidelberg (1993); Third corrected printing (1996)

    Google Scholar 

  6. Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 282–290. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

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

  8. Guajardo, J., Paar, C.: Efficient algorithms for elliptic curve cryptosystems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 342–356. Springer, Heidelberg (1997)

    Google Scholar 

  9. Kobayashi, T., Morita, H., Kobayashi, K., Hoshino, F.: Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 176–189. Springer, Heidelberg (1999)

    Google Scholar 

  10. Koblitz, N.: CM curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279–287. Springer, Heidelberg (1992)

    Google Scholar 

  11. Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95–107. Springer, Heidelberg (1994)

    Google Scholar 

  12. Lim, C.H., Lee, P.J.: A key recovery attack on discrete log-based schemes using a prime order subgroup. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 249–263. Springer, Heidelberg (1997)

    Google Scholar 

  13. Lim, C.H., Hwang, H.S.: Fast implementation of elliptic curve arithmetic in GF(pn). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Lopez, J., Dahab, R.: Improved algorithms for elliptic curve arithmetic in GF(2n). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 201–212. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  15. Meier, W., Staffelbach, O.: Efficient multiplication on certain non-supersingular elliptic curves. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 333–344. Springer, Heidelberg (1993)

    Google Scholar 

  16. Muller, V.: Fast multiplication on elliptic curves over small fields of characteristic two. J. of Cryptology 11(4), 219–234 (1998)

    Article  Google Scholar 

  17. de Rooij, P.: Efficient exponentiation using precomputation and vector addition chains. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 389–399. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  18. Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 357–371. Springer, Heidelberg (1997)

    Google Scholar 

  19. Wiener, M.J., Zuccherato, R.J.: Faster attacks on elliptic curve cryptosystems. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 190–200. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. IEEE P1363: Standard Specifications for Public Key Cryptography, Working Draft (August 1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information and Communications Research Center, Future Systems, Inc., 372-2, Yang Jae-Dong, Seo Cho-Gu, Seoul, 137-130, Korea

    Chae Hoon Lim & Hyo Sun Hwang

Authors
  1. Chae Hoon Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyo Sun Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Yonsei University, Seoul, Korea

    JooSeok Song

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, C.H., Hwang, H.S. (2000). Speeding Up Elliptic Scalar Multiplication with Precomputation. In: Song, J. (eds) Information Security and Cryptology - ICISC’99. ICISC 1999. Lecture Notes in Computer Science, vol 1787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719994_9

Download citation

  • DOI: https://doi.org/10.1007/10719994_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67380-4

  • Online ISBN: 978-3-540-45568-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation