The complexity of certain multi-eTechniques in cryptography

Journal of Cryptology

Volumn 18, Issue 4, 2005, Pages 357-373

  Avanzi, Roberto M ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Elliptic and hyperelliptic curves; Exponentiation; Groups with automorphisms; Integer recoding; Scalar multiplication; Trace zero varieties; XTR

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

EXPONENTIATION; INTEGER RECORDING; SCALAR MULTIPLICATION; XTR;

CRYPTOGRAPHY;

EID: 25144458058     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0229-5     Document Type: Article

References (38)

1. American National Standards Institute. ANSIX9.62: Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1999.
2. S. Arno and F.S. Wheeler. Signed digit representations of minimal Hamming weight. IEEE Transactions on Computers 42 (1993), 1007-1010.
3. R. Avanzi and P. Mihǎilescu. Improved arithmetic algorithms for processor adequate finite fields and related algebraic structures. In Proceedings of Selected Areas in Cryptography 2003, Carleton University, Ottawa, August 14-15, 2003, pp. 320-334. LNCS 3006. Springer-Verlag, Berlin, 2004.
4. D.J. Bernstein. Pippenger's exponentiation algorithm. Preprint. Available from http://cr.yp.to
5. A.D. Booth, A signed binary multiplication technique. The Quarterly Journal of Mechanics and Applied Mathematics 4 (1951), 236-240.
6. E.F. Brickell and K.S. McCurley. Interactive identification and digital signatures. AT&T Technical Journal, November/December, pp. 73-86, 1991.
7. B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan and S.M. Watt. Maple V Language Reference Manual. Springer-Verlag, New York, 1991.
8. H. Cohen. Analysis of the flexible window powering algorithm. Preprint. Available from http://www.math.u-bordeaux.fr/~cohen/
9. H. Cohen, A. Miyaji and T. Ono. Efficient elliptic curve exponentiation. In Proceedings ICJCS '97, pp. 282-290. LNCS 1334. Springer-Verlag, Berlin, 1997.
10. I. Duursma, P. Gaudry and F. Morain. Speeding up the discrete log computation on curves with automorphisms. In Advances in Cryptology, Asiacrypt 99. pp. 103-121. LNCS 1716. Springer-Verlag, Berlin, 1999.
11. Ö. Eǧecioǧlu and Ç. K. Koç. Exponentiation using canonical receding. Theoretical Computer Science 129(2), 407-417, 1994.
12. T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Infoimation Theory IT-31 (1985), 469-472.
13. G. Frey. Applications of arithmetical geometry to cryptographic constructions. In Finite Fields and Applications (Augsburg, 1999), pp. 128-161. Springer-Verlag, Berlin, 2001.
14. R.P. Gallant, R.J. Lambert, and S.A. Vanstone. Faster point multiplication on elliptic curves with efficient endomorphisms In Advances in Cryptology - CRYPTO 2001 Proceedings, pp. 190-200. LNCS 2139. Springer-Verlag, Berlin, 2001.
15. P. Grabner, C. Heuberger, and H. Prodinger. Distribution results for low-weight binary representations for pairs of integers. Theoretical Computer Science 319 (2004), 307-331.
16. D. E. Knuth. The Art of Computer Programming. Vol. 2, Seminumerical Algorithms, third edn. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley, Reading, MA, 1997.
17. T. Lange. Efficient Arithmetic on Hyperelliptic Curves. Ph.D. Thesis, Universität Essen, 2001.
18. T. Lange. Trace-Zero Subvarieties for Cryptosystems. Ramanujan Journal of Mathematics, to appear.
19. C.H. Lim. Efficient multi-exponentiation and application to batch verification of digital signatures. Unpublished manuscript. August 2000. See http://dasan.sejong.ac.kr/~chlim/english_pub.html
20. B. Möller. Algorithms for multi-exponentiation. In S. Vaudenay and A.M. Youssef (eds.), Selected Areas in Cryptography - SAC 2001, pp. 165-180. LNCS 2259. Springer-Verlag, Berlin, 2001.
21. B. Möller. Improved techniques for fast exponentiation. In P.J. Lee and C.H. Lim (eds.), Information Security and Cryptology - ICISC 2002, Proceedings, pp. 298-312. LNCS 2587. Springer-Verlag, Berlin, 2002.
22. F. Morain and J. Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Informatique Theorique 24 (1990), 531-543.
23. N. Naumann. Weil-Restriktion abelscher Varietäten. Master's thesis, Universität Essen, 1999.
24. NIST (National Institute of Standards and Technology). A Proposed Federal Information Processing Standard for Digital Signatures Standard (DSS). Federal Register 1991, vol. 56, pp. 42980-42982.
25. K. Okeya and K. Sakurai. Fast multi-scalar multiplication methods on elliptic curves with precomputation using Montgomery trick. In B.S. Kaliski et al (eds.), CHES 2002, pp. 564-578. LNCS 2523. Springer-Verlag, Berlin, 2003.
26. Y-H. Park, S. Jeong and J. Lim. Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms. In L. Knudsen (ed.), Advances in Cryptology-Proceedings of EUROCRYPT 2002, pp. 197-208. LNCS 2332. Springer-Verlag, Berlin, 2002.
27. G. W. Reitwiesner. Binary arithmetic. Advances in Computers 1 (1960), 231-308.
28. C.P. Schnorr. Efficient identification and signatures for smart cards. In Advances in Cryptology, Crypto '89, pp. 239-252. LNCS 435. Springer-Verlag, Berlin, 1990.
29. F. Sica, M. Ciet and J.-J. Quisquater. Analysis of the Gallant-Lambert-Vanstone method based on efficient endomorphisms: elliptic and hyperelliptic curves. In Proceedings of Selected Areas of Cryptography 2002, pp. 21-36. LNCS 2595. Springer-Verlag, Berlin, 2003.
30. S.G.Sim and P.J.Lee. An efficient implementation of two-term exponentiation in elliptic curves. In Japan-Korea Joint Workshop on Information Security and Cryptology (JW-ISC 2000), Jan. 25-26, 2000, Naha, Okinawa, pp. 61-68.
31. J.A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. In Advances in Cryptology - CRYPTO '97, pp. 357-371. LNCS 1294. Springer-Verlag, Berlin, 1997.
32. J.A. Solinas. Efficient arithmetic on Koblitz curves. Designs, Codes and. Cryptography 19 (2000), 195-249.
33. J.A. Solinas. Low-Weight Binary Representations for Pairs of Integers. Combinatorics and Optimization Research Report CORR 2001-41. Centre for Applied Cryptographic Research, University of Waterloo, 2001. Available from http://www.cacr.math.uwaterloo.ca/techreports/2001/corr2001-41.ps
34. M. Stam and A.K. Lenstra. Efficient subgroup exponentiation in quadratic and sixth degree extensions. In Proceedings of CHES 2002, pp. 318-332. LNCS 2523. Springer-Verlag, Berlin, 2003.
35. E.G. Straus. Addition chains of vectors (problem 5125). American Mathematical Monthly 71 (1964), 806-808.
36. E.G. Thurber. On addition chains l(mn) ≤ l(n)b and lower bounds for c(r). Duke Mathematical Journal 40 (1973), 907-913. MR 48 #8429.
37. E.R. Verheul and A.K. Lenstra. The XTR public key system. In Advances in Cryptography - Crypto 2000, pp. 1-19. LNCS 1880. Springer-Verlag, Berlin, 2000.
38. S.-M. Yen, C.-S. Laih and A.K. Lenstra. Multi-exponentiation. IEE Proceedings: Computers and Digital Techniques 141(6) (November 1994), 325-326.