Advertisement

Elliptic Curve Point Multiplication

  • Alexander Rostovtsev
  • Elena Makhovenko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2776)

Abstract

A method for elliptic curve point multiplication is proposed with complex multiplication by \(\sqrt-2\) or by \((1\pm \sqrt-7)/2\) instead of point doubling, speeding up multiplication about 1.34 times. Complex multiplication is given by isogeny of degree 2. Higher radix makes it possible to use one instead of two point doublings and to speed up computation about 1.61 times. Algorithm, representing exponent in \(\sqrt-2\)-adic notation for digital signature protocols, is proposed. Key agreement and public key encryption protocols can be implemented directly in \(\sqrt-2\)-adic notation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Husemöller, D.: Elliptic curves. In: Graduate Texts in Mathematics, vol. 111. Springer, Berlin (1987)Google Scholar
  3. 3.
    ANSI X9.62–1998, Public key cryptography for the financial industry: the elliptic curve digital signature algorithm (ECDSA)Google Scholar
  4. 4.
    Pollard, J.M.: Monte Carlo methods for index computation (mod p). Mathematics of Computation 32, 918–924 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dursma, I., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms. LIX Research Report LIX/RR/99/03Google Scholar
  6. 6.
    Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in finite fields. IEEE Transactions on Information Theory 39, 1636–1639 (1993)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Semaev, I.: Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation 67, 353–356 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Rostovtsev, A., Kuzmich, V., Belenko, V.: Process and method for fast scalar multiplication of elliptic curve point. Claim for US patent 09/350,158. July 9 (1999)Google Scholar
  9. 9.
    Atkin, A.O., Morain, F.: Elliptic curves and primality proving. Mathematics of Computation 61, 29–68 (1993)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alexander Rostovtsev
    • 1
  • Elena Makhovenko
    • 1
  1. 1.Department of Information Security of Computer SystemsSt. Petersburg State Polytechnic UniversitySt. PetersburgRussia

Personalised recommendations