Fast Irreducibility and Subgroup Membership Testing in XTR

  • Arjen K. Lenstra
  • Eric R. Verheul
Conference paper

DOI: 10.1007/3-540-44586-2_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1992)
Cite this paper as:
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

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Arjen K. Lenstra
    • 1
  • Eric R. Verheul
    • 2
  1. 1.Citibank, N.A.Technical University EindhovenUSA
  2. 2.PricewaterhouseCoopersGRMS Crypto GroupKE EindhovenThe Netherlands

Personalised recommendations