Presentation 1999/7/23
Efficient construction of elliptic curves over optimal extension field
Yuichi Futa, Atsuko Miyaji,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Recently, Bailey and Paar proposed Optimal Extension Field(OEF) which is defined over a base field with computer's word size. Since the arithmetic in OEF is relatively faster than that in F_<2^n>, elliptic curves over OEF would be more attractive in the application of a smart card, a personal computer, etc. However it has not been reported to construct elliptic curves over OEF. In this paper, we construct elliptic curves over OFF efficieuatly by applying SEA algorithm. Our implementation can count order of elliptic curves over 160-bit OEF in 12.4 seconds on the average on PentiumII 400MHz(Linux-2.2.5).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) elliptic curves / Optimal Extension Fields / OEF / order / SEA algoritlum
Paper # ISEC99-26
Date of Issue

Conference Information
Committee ISEC
Conference Date 1999/7/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficient construction of elliptic curves over optimal extension field
Sub Title (in English)
Keyword(1) elliptic curves
Keyword(2) Optimal Extension Fields
Keyword(3) OEF
Keyword(4) order
Keyword(5) SEA algoritlum
1st Author's Name Yuichi Futa
1st Author's Affiliation Multimedia Development Center Matsushita Electric Industrial Co. LTD.()
2nd Author's Name Atsuko Miyaji
2nd Author's Affiliation Japan Advanced Institute of Science and Technology
Date 1999/7/23
Paper # ISEC99-26
Volume (vol) vol.99
Number (no) 209
Page pp.pp.-
#Pages 8
Date of Issue