International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 1999: Advances in Cryptology - ASIACRYPT’99 pp 135-149

Elliptic Scalar Multiplication Using Point Halving

  • Erik Woodward Knudsen
Conference paper

DOI: 10.1007/978-3-540-48000-6_12

Volume 1716 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Knudsen E.W. (1999) Elliptic Scalar Multiplication Using Point Halving. In: Lam KY., Okamoto E., Xing C. (eds) Advances in Cryptology - ASIACRYPT’99. ASIACRYPT 1999. Lecture Notes in Computer Science, vol 1716. Springer, Berlin, Heidelberg


We describe a new method for conducting scalar multiplication on a non-supersingular elliptic curve in characteristic two. The idea is to replace all point doublings in the double-and-add algorithm with a faster operation called point halving.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Erik Woodward Knudsen
    • 1
  1. 1.De La Rue Card Systems