Name
Abstract | ||
|---|---|---|
Application of XTR in cryptographic protocols leads to substantial savings both in communication and computational overhead without compromising security [6]. XTR is a new method to represent elements of a subgroup of a multiplicative group of a finite field GF(p6) and it can be generalized to the field GF(p6m) [6,9]. This paper proposes optimal extension fields for XTR among Galois fields GF(p6m) which can be applied to XTR. In order to select such fields, we introduce a new notion of Generalized Optimal Extension Fields(GOEFs) and suggest a condition of prime p, a defining polynomial of GF(p2m) and a fast method of multiplication in GF(p2m) to achieve fast finite field arithmetic in GF(p2m). From our implementation results, GF(p36) 驴 GF(p12) is the most efficient extension fields for XTR and computing Tr(gn) given Tr(g) in GF(p12) is on average more than twice faster than that of the XTR system[6,10] on Pentium III/700MHz which has 32-bit architecture. |
Year | Venue | Keywords |
|---|---|---|
2002 | Selected Areas in Cryptography | optimal extension field,galois field,finite field,xtr system,fast method,finite field arithmetic,optimal extension fields,new method,new notion,field gf,efficient extension field,cryptographic protocol,public key |
Field | DocType | Volume |
Discrete mathematics,Finite field,Primitive polynomial,Multiplicative group,XTR,Polynomial,Multiplication,Finite field arithmetic,GF(2),Mathematics | Conference | 2595 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-00622-2 | 1 |
PageRank | References | Authors |
0.35 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dong-guk Han | 1 | 124 | 24.94 |
| Ki Soon Yoon | 2 | 1 | 0.35 |
| Young-Ho Park | 3 | 137 | 16.79 |
| Chang Han Kim | 4 | 69 | 8.48 |
| JongIn Lim | 5 | 819 | 75.16 |