Art

J-GLOBAL ID：201602271571857993   Reference number：16A1227179

FPGA Implementation of Various Elliptic Curve Pairings over Odd Characteristic Field with Non Supersingular Curves

非超特異曲線を持つ奇数特性体上での各種楕円曲線ペアリングのFPGA実装

Author (5)： NOGAMI Yasuyuki (Graduate School of Natural Science and Technology, Okayama University) ,  KAGOTANI Hiroto (Graduate School of Natural Science and Technology, Okayama University) ,  IOKIBE Kengo (Graduate School of Natural Science and Technology, Okayama University) ,  MIYATAKE Hiroyuki (Tokyo Electron Device Limited) ,  NARITA Takashi (Tokyo Electron Device Limited)
Material： IEICE Transactions on Information and Systems (Web)  (IEICE Trans Inf Syst (Web))
Volume： E99.D  Issue： 4  Page： 805-815(J-STAGE)  Publication year： 2016 
JST Material Number： U0469A  ISSN： 1745-1361  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *property ,  odd number ,  *curve ,  pairing ,  *packaging(mounting) ,  cryptogram ,  mapping ,  multiplication(algebra) ,  algorithm ,  projection(mathematics) ,  public key cryptography
Semi thesaurus term： *idiocrasy ,  *elliptic curve ,  pairing ,  *FPGA Implementation ,  attribute-based encryption ,  Homomorphic encryption ,  bilinear mapping ,  Montgomery multiplication ,  tate pairing

Author keywords (4)： elliptic curve cryptography ,  pairing-based cryptography ,  odd characteristic ,  FPGA implementation

JST classification (3)： Data protection  (JD01020V) ,  Code theory  (ND02030R) ,  Fundamental theory of information processing in general  (JB01000T)

Reference (32)：

• [1] R. Sakai, K. Ohgishi, and M. Kasahara, “Cryptosystems based on pairings,” SCIS2000, pp.26-28, 2000.
• [2] K. Chalkias, F. Baldimtsi, D. Hristu-Varsakelis, and G. Stephanides, “Mathematical problems and algorithms for timed-release encryption,” Bulletin of the Transilvania University of Brasov, vol.15, no.50, pp.1-4, 2008.
• [3] T. Nakanishi and N. Funabiki, “Verifier-local revocation group signature schemes with backward unlinkability from bilinear maps,” ASIACRYPT 2005, LNCS 3788, pp.533-548, Springer, 2005.
• [4] N. Begum, T. Nakanishi, and N. Funabiki, “Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system,” IEICE Trans. Fundamentals, vol.96-A, no.12, pp.2422-2433, Dec. 2013.
• [5] R. Bendlin, I. Damgård, C. Orlandi, and S. Zakarias, “Semi-homomorphic encryption and multiparty computation,” EUROCRYPT'11, LNCS 6632, pp.169-188, Springer, 2011.

Terms in the title (5)： 曲線 ,  奇数 ,  楕円曲線 ,  ペアリング ,  FPGA実装