Abstract
A. K. Lenstra and E. R. Verheul in [2] proposed a very efficient way called XTR in which certain subgroup of the Galois field GF(p 6) can be represented by elements in GF(p2). At the end of their paper [2], they briefly mentioned on a method of generalizing their idea to the field GF(p 6m). In this paper, we give a systematic design of this generalization and discuss about optimal choices for p and m with respect to performances. If we choose m large enough, we can reduce the size of p as small as the word size of common processors. In such a case, this extended XTR is well suited for the processors with optimized arithmetic on integers of word size.
Yie and Kim’s work was supported by INHA Univ. Research Grant (INHA-21072).
Chapter PDF
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
Arjen K. Lenstra, Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields, ACISP’97 (1997), LNCS 1270, pp. 127–138.
Arjen K. Lenstra, Eric R. Verheul, The XTR public key system, Advances in Cryptology—CRYPTO’00 LNCS 1880 (2000), pp. 1–19
Arjen K. Lenstra, Eric R. Verheul, Key improvements to XTR, Advances in Cryptology—Asiacrypt’00 LNCS 1976 (2000), pp. 220–233
A.K. Lenstra, E.R. Verheul, Selecting Cryptographic Key Sizes, http://www.cryptosavvy.com (1999).
Arjen K. Lenstra, Eric R. Verheul, Fast irreduciblility and subgroup membership testing in XTR, Proceedings of the PKC’01 LNCS 1992 (2001), pp. 73–86
A.E. Brouwer, R. Pellikaan, E.R. Verheul, Doing More with Fewer Bits, Advances in Cryptology—Asiacrypt’99, LNCS 1716 (1999), pp. 321–332.
Rudolf Lidl, Harald Niederreiter, Introduction to finite fields and their applications, Cambridge, 1994.
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
Lim, S., Kim, S., Yie, I., Kim, J., Lee, H. (2001). XTR Extended to GF(p 6m). In: Vaudenay, S., Youssef, A.M. (eds) Selected Areas in Cryptography. SAC 2001. Lecture Notes in Computer Science, vol 2259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45537-X_23
Download citation
DOI: https://doi.org/10.1007/3-540-45537-X_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43066-7
Online ISBN: 978-3-540-45537-0
eBook Packages: Springer Book Archive