Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security and Cryptology

ICISC 2002: Information Security and Cryptology — ICISC 2002 pp 264–282Cite as

New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms

  • Conference paper
  • First Online:

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

Abstract

The Frobenius expansion is a method to speed up scalar multiplication on elliptic curves. Nigel Smart gave a Frobenius expansion method for elliptic curves defined over odd prime fields. Gallant, Lambert and Vanstone suggested that efficiently computable endomorphisms other than Frobenius endomorphisms can be used for fast scalar multiplication. In this paper we show that these two kinds of endomorphisms can be used together for a certain class of curves, and we present a new expansion method for elliptic curves over odd prime fields. Our experimental results show that the throughputs of the known scalar multiplication algorithms are improved by 7.6 ~ 17.3% using the new expansion method.

This work was supported by the Brain Korea 21 Project and the MOST grant M6- 0203-00-0039.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.V. Bailey and C. Paar. Optimal extension fields for fast arithmetic in public key algorithms. In Advances in Cryptology-CRYPTO 98, volume 1462 of LNCS,pages 472–485. Springer-Verlag, 1998. 264, 265, 275

    Chapter  Google Scholar 

  2. D.V. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 14(3):153–176, 2001. 264, 265, 275, 276

    MATH  MathSciNet  Google Scholar 

  3. J.H. Cheon, S. Park, S. Park, and D. Kim. Two efficient algorithms for arithmetic of elliptic curves using Frobenius map. In Public Key Cryptography 98, volume1431 of LNCS, pages 195–202. Springer-Verlag, 1998. 264

    Chapter  Google Scholar 

  4. R. Gallant, R. Lambert, and S. Vanstone. Faster point multiplication on elliptic curves with efficient endomorphisms. In Advances in Cryptology-CRYPTO 2001, volume 2139 of LNCS, pages 190–200. Springer-Verlag, 2001. 264, 265, 266, 271, 277

    Chapter  Google Scholar 

  5. G.H. Hardy and E.M. Wright.An Introduction to the Theory of Numbers. Oxford University Press, 3rd edition, 1954. 267, 279

    Google Scholar 

  6. T. Kobayashi. Base-ø method for elliptic curves over OEF. IEICE Trans. Fundamentals, E83-A(4):679–686, 2000. 264, 265, 271, 272, 275

    Google Scholar 

  7. T. Kobayashi, H. Morita, K. Kobayashi, and F. Hoshino. Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic. In Advances in Cryptology-EUROCRYPT 99, volume 1592 of LNCS, pages 176–189. Springer-Verlag, 1999. 264, 265, 271, 272, 276

    Google Scholar 

  8. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203–209, 1987. 264

    Article  MATH  MathSciNet  Google Scholar 

  9. N. Koblitz. CM-curves with good cryptographic properties. In Advances in Cryptology-CRYPTO 91, volume 576 of LNCS, pages 279–287. Springer-Verlag, 1991. 264

    Google Scholar 

  10. C.H. Lim and H. S. Hwang. Speeding up elliptic scalar multiplication with precomputation. In Information Security and Cryptology-ICISC 99, volume 1787 of LNCS, pages 102–119. Springer-Verlag, 1999. 264, 265, 271, 273

    Chapter  Google Scholar 

  11. C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Advances in Cryptology-CRYPTO 94, volume 839 of LNCS, pages 95–107. Springer-Verlag, 1994. 264, 273, 281

    Google Scholar 

  12. W. Meier and O. Staffelbach. Efficient multiplication on certain non-supersingular elliptic curves. In Advances in Cryptology-CRYPTO 92, volume 740 of LNCS, pages 333–344. Springer-Verlag, 1992. 264

    Google Scholar 

  13. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993. 265

    Google Scholar 

  14. V. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology-CRYPTO 85, volume 218 of LNCS, pages 417–428. Springer-Verlag, 1986. 264

    Google Scholar 

  15. B. Möller. Algorithms for multi-exponentiation. In Selected Areas in Cryptography-SAC 2001, volume 2259 of LNCS, pages 165–180. Springer-Verlag, 2001. 277

    Chapter  Google Scholar 

  16. F. Morain and J. Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications, 24:531–543, 1990. 264

    MATH  MathSciNet  Google Scholar 

  17. V. Müller. Fast multiplication on elliptic curves over small fields of characteristic two. Journal of Cryptology, 11:219–234, 1998. 264

    Article  MATH  Google Scholar 

  18. J.R. Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag, 1986. 265, 267

    Google Scholar 

  19. N.P. Smart. Elliptic curve cryptosystems over small fields of odd characteristic. Journal of Cryptology, 12:141–151, 1999. 264, 266, 272, 275

    Article  MATH  MathSciNet  Google Scholar 

  20. J.A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. In Advances in Cryptology-CRYPTO 97, volume 1294 of LNCS, pages 357–371. Springer-Verlag, 1997. 264

    Chapter  Google Scholar 

  21. J.A. Solinas. Efficient arithmetic on Koblitz curves. Designs, Codes and Cryptography, 19:195–249, 2000. 264

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Tae-Jun Park, Mun-Kyu Lee & Kunsoo Park

Authors
  1. Tae-Jun Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mun-Kyu Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kunsoo Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Pohnag University of Science and Technology, San 31, Hyoja-dong, Nam-gu, Pohang, 790-784, Kyungbuk, Korea

    Pil Joong Lee

  2. Sejong University, 98, Gunja-dong, Gwangjin-gu, 143-747, Seoul, Korea

    Chae Hoon Lim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, TJ., Lee, MK., Park, K. (2003). New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms. In: Lee, P.J., Lim, C.H. (eds) Information Security and Cryptology — ICISC 2002. ICISC 2002. Lecture Notes in Computer Science, vol 2587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36552-4_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-36552-4_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00716-6

  • Online ISBN: 978-3-540-36552-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation