Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |

ICSS, IPSJ-SPT |
2018-03-07 13:00 |
Hokkaido |
Okinawa Hokubu Koyou Nouryoku Kaihatsu Sougou Center |
On the effectiveness of solving ECDLP using Characteristic set methods Tomoya Nishiguchi, Chen Mou, Kenta kodera, Atuko Miyaji (Osaka Univ.) ICSS2017-55 |
An elliptic curves cryptosystem is cryptography which guarantee safety in public key cryptosystem.When we use index calc... [more] |
ICSS2017-55 pp.25-30 |

ISEC, WBS, IT |
2017-03-09 15:50 |
Tokyo |
TOKAI University |
Construction of covering curves of elliptic curves over finite fields of even characteristic using simple extension Seiya Kukisaki (Chuo Univ.), Mahoro Simura (Tokai Univ.), Jinhui Chao (Chuo Univ.) IT2016-111 ISEC2016-101 WBS2016-87 |
The GHS attacks present a serious threat to cryptosystems using elliptic curves over extensions of finite fields when th... [more] |
IT2016-111 ISEC2016-101 WBS2016-87 pp.79-83 |

IA, ICSS |
2015-06-11 15:15 |
Fukuoka |
Kyushu Institute of Technology Univ. |
Implementation of a Pairing Library Using BN Elliptic Curve Yusuke Kanbara, Naoki Kanayama, Takashi Nishide, Eiji Okamoto (Univ. of Tsukuba) IA2015-5 ICSS2015-5 |
Bilinear mapping which called a pairing can realize high performance cryptographic protocols which could not be construc... [more] |
IA2015-5 ICSS2015-5 pp.21-26 |

ICSS |
2015-03-04 09:00 |
Okinawa |
Meio Univiersity |
A New Explicit Relation Between Trace, Definition Field, and Embedding Degree Atsuko Miyaji, Satoru Tanaka (JAIST) ICSS2014-76 |
For pairing based cryptography, elliptic curves defined over a finite fields $mathbb{F}_p^m$ with moderate embedding deg... [more] |
ICSS2014-76 pp.79-84 |

ISEC, IT, WBS |
2015-03-02 15:35 |
Fukuoka |
The University of Kitakyushu |
Analysis on isomorphism classes of elliptic curves subjected to GHS attack over prime degree extensions of finite fields with odd characteristic Takayuki Hosogaya (Chuo Univ.), Tsutomu Iijima (Koden), Mahoro Shimura (Tokai Univ.), Jinhui Chao (Chuo Univ.) IT2014-76 ISEC2014-89 WBS2014-68 |
The GHS attack is known to map the discrete logarithm problem (DLP) in the Jacobian of a curve $C_0$ defined over the $d... [more] |
IT2014-76 ISEC2014-89 WBS2014-68 pp.89-95 |

ISEC, LOIS |
2012-11-22 14:45 |
Shizuoka |
Shizuoka City Industry-University Exchange Center |
A New Explicit Relation between Trace, Definition Field, and Embedding Degree Atsuko Miyaji, Xiaonan Shi (JAIST) ISEC2012-69 LOIS2012-44 |
For pairing based cryptography we need elliptic curves defined over extension nite elds Fpm with
moderate embedding ... [more] |
ISEC2012-69 LOIS2012-44 pp.83-88 |

ISEC, IT, WBS |
2011-03-04 09:50 |
Osaka |
Osaka University |
Proposition of precomputation schemes considering memory Taiki Sasahara, Atsuko Miyaji (JAIST) IT2010-94 ISEC2010-98 WBS2010-73 |
Elliptic Curve Cryptography (ECC) attract attention as a effective Public Key Cryptography. A central arithmetic on EC... [more] |
IT2010-94 ISEC2010-98 WBS2010-73 pp.159-166 |

IT, ISEC, WBS |
2010-03-05 16:10 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
A study on the probabilistic algorithm to solve the elliptic curve discrete logarithm problem Osamu Ashihara, Yoshitaka Sagara, Nobuhide Sakuragi, Tomoko K. Matsushima (Polytechnic Univ.) IT2009-129 ISEC2009-137 WBS2009-108 |
In this paper a probabilistic algorithm to solve the ECDLP is presented. This scheme uses the symmetry of the elliptic c... [more] |
IT2009-129 ISEC2009-137 WBS2009-108 pp.373-380 |

ISEC |
2009-09-25 15:20 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
An Implementation of Tate Pairing with Non-Supersingular Curves of Embedding degree 1 Tetsuya Izuta, Yumi Sakemi, Kazushi Nishii, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa (Okayama Univ.) ISEC2009-48 |
Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the ot... [more] |
ISEC2009-48 pp.59-64 |

ISEC |
2009-09-25 16:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A verifiable server-aided computation of scalar multiplication on elliptic curves Kouta Tamura, Naoki Kanayama, Akira Kanaoka, Tadahiko Ito, Masahiro Mambo, Eiji Okamoto (Univ. of Tsukuba) ISEC2009-50 |
Server-aided computation is the method which delegates computation to server side to execute heavy computation
like a ... [more] |
ISEC2009-50 pp.73-78 |

ISEC, IPSJ-CSEC, SITE, ICSS [detail] |
2009-07-03 09:30 |
Akita |
Akita University |
Accelerating Cross Twisted Ate Pairing with Ordinary Pairing Friendly Curve of Composite Order That Has Two Large Prime Factors Yumi Sakemi, Kazushi Nishii, Tetsuya Izuta, Tatsuya Yuasa, Yasuyuki Nogami, Yoshitaka Morikawa (Okayama Univ.) ISEC2009-25 SITE2009-17 ICSS2009-39 |
Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the ot... [more] |
ISEC2009-25 SITE2009-17 ICSS2009-39 pp.125-129 |

ISEC, LOIS |
2008-11-14 09:30 |
Aichi |
Nagoya Noh Theater |
Elliptic curves with a pre-determined embedding degree. Shoujirou Hirasawa, Atsuko Miyaji (Japan Advanced Instisute of Science and Technology) ISEC2008-82 OIS2008-58 |
Embedding degree k is one indicator to the difference between on the elliptic curve discrete logarithm problem (ECDLP) a... [more] |
ISEC2008-82 OIS2008-58 pp.63-66 |

RECONF |
2008-05-22 14:15 |
Fukushima |
The University of Aizu |
FPGA Implementation of Elliptic Curve Arithmetic in Characteristic Five by High-level Synthesis YoungKwang Moon (Tokyo Univ.), Hideyuki Tsuchiya, Yuichiro Shibata, Ryuichi Harasawa, Kiyoshi Oguri (Nagasaki Univ.) RECONF2008-4 |
The Tate pairing, which is a mapping on elliptic curves, has been
applied to many cryptographic protocols such as a tri... [more] |
RECONF2008-4 pp.19-24 |

ISEC, SITE, IPSJ-CSEC |
2006-07-20 10:20 |
Okayama |
Okayama Univ. |
Pairing Computation with MNT Curve over All One Polynomial Field Masataka Akane, Takumi Okimoto, Yasuyuki Nogami, Yoshitaka Morikawa (Okayama Univ.) |
In recent years, many cryptographic applications with bilinear-pairing over elliptic curves have been proposed. The well... [more] |
ISEC2006-11 SITE2006-8 pp.13-18 |