Efficient Construction of Elliptic Curves over Optimal Extension Field

• Futa, Yuichi

• Miyaji, Atsuko

抄録

Recently, Bailey and Paar proposed the Optimal Extension Field (OEF) which is defined over a base field with a computer's word size. Since the arithmetic in an OEF is relatively faster than that in F_<2n>, elliptic curves over an OEF would be more attractive when applied to a smart card, a personal computer, etc. However the definition of an OEF is rather strict since it is based on a general condition sufficient for fast arithmetic. In this paper, we extend the definition of an OEF such that it includes more extension fields with efficient arithmetic. Furthermore we construct elliptic curves over an OEF including our extended OEF efficiently by applying the SEA algorithm. Our implementation can count order of elliptic curves over 155-bit extended OEF and 160-bit OEF in 10.1 and 11.6 seconds on average on PentiumII 400 MHz(Linux-2.2.5), respectively.

identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/4384

収録刊行物

• 情報処理学会論文誌

  情報処理学会論文誌 41 (8), 2092-2101, 2000-08

  情報処理学会

キーワード

• 特集：情報セキュリティの理論と応用

詳細情報

• CRID: 1050001337537036672
• NII論文ID: 110002725478
• NII書誌ID: AN00116647
• ISSN: 03875806
• ISSN: 18827764
• NDL書誌ID: 5491625
• Web Site: http://hdl.handle.net/10119/4384
• Web Site: http://id.nii.ac.jp/1001/00012213/
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I5491625
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • NDL
  • CiNii Articles