@inproceedings{faf7d857fd5348adad2e75edbad23d4e,
title = "XTR extended to GF(P6m)",
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(p6) 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(p6m). 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.",
author = "Seongan Lim and Seungjoo Kim and Ikkwon Yie and Jaemoon Kim and Hongsub Lee",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001 ; Conference date: 16-08-2001 Through 17-08-2001",
year = "2001",
doi = "10.1007/3-540-45537-x_23",
language = "English",
isbn = "9783540430667",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "301--312",
editor = "Serge Vaudenay and Youssef, {Amr M.}",
booktitle = "Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers",
}