XTR extended to GF(P6m)

Seongan Lim, Seungjoo Kim, Ikkwon Yie, Jaemoon Kim, Hongsub Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationSelected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers
EditorsSerge Vaudenay, Amr M. Youssef
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540430667
Publication statusPublished - 2001
Externally publishedYes
Event8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001 - Toronto, Canada
Duration: 2001 Aug 162001 Aug 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'XTR extended to GF(P6m)'. Together they form a unique fingerprint.

Cite this