Fast Irreducibility and Subgroup Membership Testing in XTR
- 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
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.