XTR extended to GF(P6m)

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

doi:10.1007/3-540-45537-x_23

XTR extended to GF(P6m)

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

16 Citations (Scopus)

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⁶) 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.

Original language	English
Title of host publication	Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers
Editors	Serge Vaudenay, Amr M. Youssef
Publisher	Springer Verlag
Pages	301-312
Number of pages	12
ISBN (Print)	9783540430667
DOIs	https://doi.org/10.1007/3-540-45537-x_23
Publication status	Published - 2001
Externally published	Yes
Event	8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001 - Toronto, Canada Duration: 2001 Aug 16 → 2001 Aug 17

Publication series

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

Other

Other	8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001
Country/Territory	Canada
City	Toronto
Period	01/8/16 → 01/8/17

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45537-x_23

Cite this

Lim, S., Kim, S., Yie, I., Kim, J., & Lee, H. (2001). XTR extended to GF(P6m). In S. Vaudenay, & A. M. Youssef (Eds.), Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers (pp. 301-312). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2259). Springer Verlag. https://doi.org/10.1007/3-540-45537-x_23

XTR extended to GF(P6m). / Lim, Seongan; Kim, Seungjoo; Yie, Ikkwon et al.

Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers. ed. / Serge Vaudenay; Amr M. Youssef. Springer Verlag, 2001. p. 301-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2259).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lim, S, Kim, S, Yie, I, Kim, J & Lee, H 2001, XTR extended to GF(P6m). in S Vaudenay & AM Youssef (eds), Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2259, Springer Verlag, pp. 301-312, 8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001, Toronto, Canada, 01/8/16. https://doi.org/10.1007/3-540-45537-x_23

Lim S, Kim S, Yie I, Kim J, Lee H. XTR extended to GF(P6m). In Vaudenay S, Youssef AM, editors, Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers. Springer Verlag. 2001. p. 301-312. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45537-x_23

Lim, Seongan ; Kim, Seungjoo ; Yie, Ikkwon et al. / XTR extended to GF(P6m). Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers. editor / Serge Vaudenay ; Amr M. Youssef. Springer Verlag, 2001. pp. 301-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

}

TY - GEN

T1 - XTR extended to GF(P6m)

AU - Lim, Seongan

AU - Kim, Seungjoo

AU - Yie, Ikkwon

AU - Kim, Jaemoon

AU - Lee, Hongsub

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84949227532&partnerID=8YFLogxK

U2 - 10.1007/3-540-45537-x_23

DO - 10.1007/3-540-45537-x_23

M3 - Conference contribution

AN - SCOPUS:84949227532

SN - 9783540430667

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 301

EP - 312

BT - Selected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers

A2 - Vaudenay, Serge

A2 - Youssef, Amr M.

PB - Springer Verlag

T2 - 8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001

Y2 - 16 August 2001 through 17 August 2001

ER -

XTR extended to GF(P6m)

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this