Art

J-GLOBAL ID：201702272136649145   Reference number：17A0148575

A Weil Pairing on a Family of Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms

効率的に計算可能な自己同形写像を用いた種数2の超楕円曲線の族に関するWeilペアリング

Author (3)： ISHII Masahiro (School of Computing, Tokyo Institute of Technology) ,  INOMATA Atsuo (Tokyo Denki University) ,  FUJIKAWA Kazutoshi (Information Initiative Center, Nara Institute of Science and Technology)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web)  (IEICE Trans Fundam Electron Commun Comput Sci (Web))
Volume： E100.A  Issue： 1  Page： 62-72(J-STAGE)  Publication year： 2017 
JST Material Number： U0466A  ISSN： 1745-1337  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *pairing ,  *isomorphic mapping ,  *curve ,  torsion(phenomenon) ,  security ,  function(mathematics) ,  public key cryptography
Semi thesaurus term： *Weilペアリング ,  *automorphism ,  tate pairing ,  pairing ,  hyperelliptic curve

Author keywords (5)： Weil pairing ,  pairing-friendly hyperelliptic curves ,  automorphism ,  twist ,  miller function

JST classification (4)： Algebra  (AB02000R) ,  Geometry  (AB06000T) ,  Code theory  (ND02030R) ,  Data protection  (JD01020V)

Reference (24)：

• [1] M. Scott, “Scaling security in pairing-based protocols,” Cryptology ePrint Archive, Report 2005/139, Available: http://eprint.iacr.org/2005/139, 2005.
• [2] C.-A. Zhao, D. Xie, F. Zhang, J. Zhang, and B.-L. Chen, “Computing bilinear pairings on elliptic curves with automorphisms,” Des. Codes Cryptogr., vol.58, no.1, pp.35-44, 2011.
• [3] X. Fan, G. Gong, and D. Jao, “Speeding up pairing computations on genus 2 hyperelliptic curves with efficiently computable automorphisms,” Pairing-Based Cryptography, Pairing 2008, Lecture Notes in Computer Science, vol.5209, pp.243-264, Springer Berlin Heidelberg, 2008.
• [4] R. Barbulescu, P. Gaudry, A. Joux, and E. Thomé, “A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic,” Advances in Cryptology, EUROCRYPT 2014, Lecture Notes in Computer Science, vol.8441, pp.1-16, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014.
• [5] R. Barbulescu, P. Gaudry, A. Guillevic, and F. Morain, “Improving NFS for the discrete logarithm problem in non-prime finite fields,” Advances in Cryptology, EUROCRYPT 2015, Lecture Notes in Computer Science, vol.9056, pp.129-155, Springer Berlin Heidelberg, Berlin, Heidelberg, 2015.

Terms in the title (5)： 計算 ,  自己同形写像 ,  種数 ,  楕円曲線 ,  ペアリング