Conference ProceedingsOPEN ACCESS

Fast irreducibility and subgroup membership testing in XTR

Lecture Notes in Computer Science (2001) 1992 73-86
DOI: 10.1007/3-540-44586-2_6
22Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Lenstra, A. K., & Verheul, E. R. (2001). Fast irreducibility and subgroup membership testing in XTR. In Lecture Notes in Computer Science (Vol. 1992, pp. 73–86). Springer Verlag. https://doi.org/10.1007/3-540-44586-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free