Sciweavers

PKC
2001
Springer

Fast Irreducibility and Subgroup Membership Testing in XTR

14 years 4 months ago
Fast Irreducibility and Subgroup Membership Testing in XTR
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.
Arjen K. Lenstra, Eric R. Verheul
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where PKC
Authors Arjen K. Lenstra, Eric R. Verheul
Comments (0)