Abstract
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a cheap precomputation. Both methods are on average more than 60% faster than the old methods, thus more than doubling the speed of the already fast XTR signature applications. An additional advantage of the new double exponentiation method is that it no longer requires matrices, thereby making XTR easier to implement. Another XTR single exponentiation method is presented that does not require precomputation and that is on average more than 35% faster than the old method. Existing applications of similar methods to LUC and elliptic curve cryptosystems are reviewed.
The first author is sponsored by STW project EWI.4536
Chapter PDF
Similar content being viewed by others
References
E. Bach, J. Shallit, Algorithmic Number Theory, The MIT Press, 1996.
M. Brown, D. Hankerson, J. López, A. Menezes, Software implementation of the NIST elliptic curves over prime fields, Proceedings RSA Conference 2001, LNCS 2020, Springer-Verlag 2001, 250–265.
H. Cohen, A course in computational algebraic number theory, GTM 138, Springer-Verlag 1993.
H. Cohen, A.K. Lenstra, Implementation of a new primality test, Math. Comp. 48 (1987) 103–121.
H. Cohen, A. Miyaji, T. Ono, Efficient elliptic curve exponentiation using mixed coordinates, Proceedings Asiacrypt’98, LNCS 1514, Springer-Verlag 1998, 51–65.
R.P. Gallant, R.J. Lambert, S.A. Vanstone, Faster point multiplication on elliptic curves with efficient endomorphisms, Proceedings Crypto 2001, LNCS 2139, Springer-Verlag 2001, 190–200.
D.E. Knuth, The art of computer programming, Volume 2, Seminumerical Algorithms, third edition, Addison-Wesley, 1998.
A.K. Lenstra, The long integer package FREELIP, available from http://www.ecstr.com.
A.K. Lenstra, Unbelievable security: matching AES security using public key systems, Proceedings Asiacrypt 2001, Springer-Verlag 2001, this volume.
A.K. Lenstra, E.R. Verheul, The XTR public key system, Proceedings of Crypto 2000, LNCS 1880, Springer-Verlag 2000, 1–19; available from http://www.ecstr.com.
A.K. Lenstra, E.R. Verheul, Key improvements to XTR, Proceedings of Asiacrypt 2000, LNCS 1976, Springer-Verlag 2000, 220–233; available from http://www.ecstr.com.
A.K. Lenstra, E.R. Verheul, Fast irreducibility and subgroup membership testing in XTR, Proceedings PKC 2001, LNCS 1992, Springer-Verlag 2001, 73–86; available from http://www.ecstr.com.
P.L. Montgomery, Modular multiplication without trial division, Math. Comp. 44 (1985) 519–521.
P.L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Math. Comp. 48 (1987) 243–264.
P.L. Montgomery, Evaluating recurrences of form X m+n = f(X m , X n , X m-n ) via Lucas chains, January 1992; ftp.cwi.nl: /pub/pmontgom/Lucas.pz.gz.
P.L. Montgomery, Private communication: expon2.txt, Dual elliptic curve exponentiation, manuscript, Microsoft Research, August 2000.
S.C. Pohlig, M.E. Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance, IEEE Trans. on IT, 24 (1978), 106–110.
P. Smith, C. Skinner, A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms, Proceedings of Asiacrypt’ 94, LNCS 917, Springer-Verlag 1995, 357–364.
B. Vallée, Dynamics of the binary Euclidean algorithm: functional analysis and operators, Algorithmica 22 (1998), 660–685; and other related papers available from http://www.users.info-unicaen.fr/~brigitte/Publications/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stam, M., Lenstra, A.K. (2001). Speeding Up XTR. In: Boyd, C. (eds) Advances in Cryptology — ASIACRYPT 2001. ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45682-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-45682-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42987-6
Online ISBN: 978-3-540-45682-7
eBook Packages: Springer Book Archive