| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ICSS, IPSJ-SPT | 2024-03-22 11:45 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Fast and Secure Scalar Multiplication for the GLS254 Binary Elliptic Curve Ryosuke Kido, Atsuko Miyaji (OU)  ICSS2023-94 |
Elliptic curve cryptosystems (ECCs) are cryptographic schemes based on the discrete logarithm problem on an elliptic cur... [more] | ICSS2023-94 pp.180-187 |
| RCC, ISEC, IT, WBS | 2024-03-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) | [Invited Talk]
Cryptographic Research Based on Algebraic Curve Computation Katsuyuki Takashima (Waseda Univ.) IT2023-116 ISEC2023-115 WBS2023-104 RCC2023-98 |
We have a wide range of cryptographic primitives based on elliptic curves, i.e., widely deployed public key cryptosystem... [more] | IT2023-116 ISEC2023-115 WBS2023-104 RCC2023-98 p.265 |
| ISEC | 2018-05-16 10:00 |
Tokyo | Ookayama Campus, Tokyo Institute of Technology | Hardness of Discrete Logarithm Problem Based on New Operation on Elliptic Curve over Finite Field and New Digital Signature Masaaki Shirase (FUN) ISEC2018-1 |
In the previous works, a new operation on elliptic curve over finite field $E(Fp)$, the Me operation $oplus$, is defined... [more] | ISEC2018-1 pp.1-8 |
| 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 |
| SITE, EMM, ISEC, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2017-07-15 14:15 |
Tokyo | Zynq-based Coprocessor Development Environment for Cryptography with Advanced Functionality and Its Evaluation Takanori Miyoshi, Tsutomu Matsumoto (YNU) ISEC2017-37 SITE2017-29 ICSS2017-36 EMM2017-40 |
Bilinear pairing has a potential to produce a lot of new cryptographic protocols enabling advanced functionalities such ... [more] | ISEC2017-37 SITE2017-29 ICSS2017-36 EMM2017-40 pp.275-280 |
|
| ISEC, WBS, IT | 2017-03-09 14:25 |
Tokyo | TOKAI University | Elliptic Curves Subjected to the GHS Attack on Composite Degree Extension Fields of Odd Characteristic Part II Tappei Kobayashi (Chuo Univ.), Tsutomu Iijima (Koden Electronics), Jinhui Chao (Chuo Univ.) IT2016-105 ISEC2016-95 WBS2016-81 |
The GHS attack to elliptic/hyperelliptic curves cryptosystem is an attack to solve discrete logarithm problems (DLP) in ... [more] | IT2016-105 ISEC2016-95 WBS2016-81 pp.41-48 |
| ISEC, WBS, IT | 2017-03-09 15:25 |
Tokyo | TOKAI University | Security evaluation of elliptic curve cryptosystems with special addition formula Kodera Kenta (Osaka Univ.), Miyaji Atsuko (Osaka Univ./JAIST), Cheng Chen-Mou (Osaka Univ.) IT2016-110 ISEC2016-100 WBS2016-86 |
Recently, multivariate polynomial is applied to solve Elliptic Curve Discrete Logarithm Probrem (ECDLP). Not only Weiers... [more] | IT2016-110 ISEC2016-100 WBS2016-86 pp.73-78 |
| 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 |
| ISEC | 2015-09-04 10:30 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Improved addition algorithm for Edwards Curve Masaaki Shirase (Future Univ Hakodate) ISEC2015-25 |
This paper introduces a new coordinate system (named ${cal P}times {cal P}$ coordinate system) in which a point $(x,y)$ ... [more] | ISEC2015-25 pp.1-8 |
| 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:25 |
Okinawa | Meio Univiersity | Scalar Multiplication Algorithm with Resistance for Side-channel Attacks Keisuke Kito (JAIST), Atsuko Miyaji (JAIST/JST CREST), Ryota Takahashi (JAIST) ICSS2014-77 |
Elliptic curve cryptosystems require shorter key length than traditional cryptosystems. It is good that scalar multiplic... [more] | ICSS2014-77 pp.85-90 |
| ISEC, LOIS, SITE | 2014-11-21 14:40 |
Hyogo | Elliptic curves subjected to the GHS attack over prime degree extension fields in odd characteristic Tsutomu Iijima (Koden), Jinhui Chao (Chuo Univ) ISEC2014-59 SITE2014-50 LOIS2014-29 |
One of the most powerful attacks to elliptic curve and hyperelliptic based cryptosystems defined over an extension of a ... [more] | ISEC2014-59 SITE2014-50 LOIS2014-29 pp.19-26 |
|
| ISEC | 2013-05-23 15:35 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Improvement in Addition formula on Elliptic Curves Yoshitaka Nagai (Future Univ. Hakodate), Tetsuya Izu (Fujitsu Lab), Masaaki Shirase (Future Univ. Hakodate) ISEC2013-7 |
It is important to speed up scalar multiplication in elliptic curve cryptosystem and then various speeding-up techniques... [more] | ISEC2013-7 pp.39-46 |
| IT, ISEC, WBS | 2013-03-07 11:20 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Improved Elliptic Curve Scalar Multiplication Using Triple Formula Atsuko Miyaji, Cuinan Yang (JAIST) IT2012-68 ISEC2012-86 WBS2012-54 |
Elliptic Curve Cryptosystems (ECC) has attracted much attention because of its short key size in comparison to other pub... [more] | IT2012-68 ISEC2012-86 WBS2012-54 pp.39-44 |
| ISEC, LOIS | 2011-11-15 09:25 |
Osaka | Osaka Electro-Communication University | Fault Sensitivity Analysis Against Elliptic Curve Cryptosystems Using Clockwise Collisions Hikaru Sakamoto, Yang Li, Kazuo Ohta, Kazuo Sakiyama (Univ. of Electro-Comm.) ISEC2011-49 LOIS2011-43 |
In this paper, we propose a new fault analysis attack technique using Clockwise Collision. Generally, for the combinatio... [more] | ISEC2011-49 LOIS2011-43 pp.101-108 |
| ISEC, IT, WBS | 2011-03-04 09:00 |
Osaka | Osaka University | Construction of non-hyperelliptic coverings for elliptic curves on extension fields Hiroyuki Hara (Chuo Univ.), Tsutomu Iijima, Mahoro Shimura (Tokai Univ.), Jinhui Chao (Chuo Univ.) IT2010-92 ISEC2010-96 WBS2010-71 |
The GHS attack transfers the discrete logarithm problem(DLP) in the group of rational points of an elliptic curve over a... [more] | IT2010-92 ISEC2010-96 WBS2010-71 pp.143-150 |
| ISEC, IT, WBS | 2011-03-04 09:25 |
Osaka | Osaka University | GHS attack to elliptic curves on cubic fields of odd characteristic using B.Smith's hyperellptic-to-nonhyperelliptic transform Kazuki Ohkawa (Chuo Univ.), Tsutomu Iijima, Jinhui Chao (Chuo Univ.) IT2010-93 ISEC2010-97 WBS2010-72 |
GHS attack to elliptic curves over cubic fields with hyperelliptic covering of genus three is not effective.In this pape... [more] | IT2010-93 ISEC2010-97 WBS2010-72 pp.151-157 |
| ISEC | 2009-09-25 10:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Study on Higher Order Difference Operation for Calculating a Large Number of Elliptic Curve Scalar Multiples Tomoko K. Matsushima, Yoshitaka Sagara, Nobuhide Sakuragi (Polytechnic Univ.), Osamu Ashihara ISEC2009-40 |
Efficient elliptic curve arithmetic is crucial for cryptosystems based on elliptic curves. Such cryptosystems often requ... [more] | ISEC2009-40 pp.1-8 |
| WBS, IT, ISEC | 2009-03-10 09:25 |
Hokkaido | Hakodate Mirai Univ. | Elliptic curves with a pre-determined embedding degree Shoujirou Hirasawa, Atsuko Miyaji (JAIST) IT2008-79 ISEC2008-137 WBS2008-92 |
A paring over an elliptic-curve E(F_{p^m}) to an extension field of F_{p^{mk}} has begun to be attractive to cryptosyste... [more] | IT2008-79 ISEC2008-137 WBS2008-92 pp.223-229 |
| ISEC, SITE, IPSJ-CSEC | 2008-07-24 14:15 |
Fukuoka | Fukuoka Institute of System LSI Design Industry | Knapsack Cryptosystem on Elliptic Curves of Trace Tow Koichiro Noro, Kunikatsu Kobayashi (Yamagata Univ.) ISEC2008-19 SITE2008-13 |
The LLL algorithm is strong algorithm that decrypts the additional type Knapsack cryptosystem.However, the LLL algorithm... [more] | ISEC2008-19 SITE2008-13 pp.23-26 |
[Return to Top Page]