Abstract
We describe a new general method to perform part of the setup stage of the XTR system introduced at Crypto 2000, namely finding the trace of a generator of the XTR group. Our method is substantially faster than the general method presented at Asiacrypt 2000. As a side result, we obtain an efficient method to test subgroup membership when using XTR.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Biehl, B. Meyer, V. Müller, Differential fault attacks on elliptic curve cryptosystems, Proceedings of Crypto 2000, LNCS 1880, Springer-Verlag, 2000, 131–146.
M.V.D. Burmester, A remark on the efficiency of identification schemes, Proceedings of Eurocrypt’90, LNCS 473, Springer-Verlag 1990, 493–495.
R. Cramer, V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, Proceedings of Crypto’98, LNCS 1462, Springer-Verlag 1998, 13–25.
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.
C.H. Lim, P.J. Lee, A key recovery attack on discrete log-based schemes using a prime order subgroup, Proceedings of Crypto’97, LNCS 1294, Springer-Verlag 1997, 249–263.
W.K. Nicholson, Introduction to abstract algebra, PWS-Kent Publishing Company, Boston, 1993.
P.C. van Oorschot, M.J. Wiener, On Diffie-Hellman key agreement with short exponents, Proceedings of Eurocrypt’ 96, LNCS 1070, Springer-Verlag 1996, 332–343.
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.
H. Riesel, Prime numbers and computer methods for factorization, Birkhäuser, Boston, 1985.
E.R. Verheul, M.P. Hoyle, Tricking the Chaum-Pedersen protocol, manuscript, 1998.
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
Lenstra, A.K., Verheul, E.R. (2001). Fast Irreducibility and Subgroup Membership Testing in XTR. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive