| 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 |
| HWS, VLD [detail] | 2020-03-06 13:50 |
Okinawa | Okinawa Ken Seinen Kaikan (Cancelled but technical report was issued) |
Design Space Search for Faster Fp256 Elliptic Curve Cryptography Kento Ikeda (Tokyo Univ.), Makoto Ikeda (d.lab) VLD2019-130 HWS2019-103 |
In this study, we created a scheduling of operations by changing parameters such as elliptic curves, their formulas, the... [more] | VLD2019-130 HWS2019-103 pp.209-214 |
| WBS, IT, ISEC | 2018-03-08 10:15 |
Tokyo | Katsusika Campas, Tokyo University of Science | High Efficient Scalar Multiplication in Elliptic Curve Cryptography Noboru Takeuchi, Toshiyuki Kinoshita (TUT) IT2017-120 ISEC2017-108 WBS2017-101 |
(To be available after the conference date) [more] | IT2017-120 ISEC2017-108 WBS2017-101 pp.97-101 |
| ICSS, IPSJ-SPT | 2016-03-04 15:40 |
Kyoto | Academic Center for Computing and Media Studies, Kyoto University | Improvement and implementation of scalar multiplication algorithms with side-channel protection Keisuke Kito (JAIST), Atsuko Miyaji (Osaka Univ./JAIST/JST CREST) ICSS2015-71 |
Elliptic Curve Cryptosystems require shorter key length than traditional cryptosystems and is suitable for memory limite... [more] | ICSS2015-71 pp.147-152 |
| 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 |
| ICSS, ISEC, SITE, EMM, IPSJ-CSEC, IPSJ-SPT [detail] | 2014-07-03 14:40 |
Hokkaido | San-Refure Hakodate | A New Precomputation Method with Perfect Conjugate-Addition Sequence Ryota Takahashi, Atsuko Miyaji (JAIST) ISEC2014-20 SITE2014-15 ICSS2014-24 EMM2014-20 |
In elliptic curve cryptosystems, a scalar multiplication is the dominant computation. For speeding up elliptic curve c... [more] |
ISEC2014-20 SITE2014-15 ICSS2014-24 EMM2014-20 pp.97-104 |
| IT | 2014-01-27 15:50 |
Osaka | Osaka City University | An Implementation of Elliptic Curve Scalar Multiplication with Improved Quadrupling of Rational Point Gegerihu, Yasuyuki Nogami (Okayama Univ.), Masaaki Shirase (Future Univ. Hakodate) IT2013-53 |
This paper introduces a fast implementation of elliptic curve scalar multiplication with an improved quadrupling in Jaco... [more] | IT2013-53 pp.45-49 |
| 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 |
| 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 |
| 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 |
| ISEC | 2008-05-16 14:40 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Study on Higher Order Differnce Operation for Elliptic Curve Scalar Multiplication Using Path Table Tomoko K. Matsushima, Yoshitaka Sagara, Osamu Ashihara (Polytechnic Univ.) ISEC2008-11 |
Efficient elliptic curve arithmetic is crucial for cryptosystems based on elliptic curves. Such cryptosystems often requ... [more] | ISEC2008-11 pp.69-76 |
| ISEC, IT, WBS | 2008-02-28 17:45 |
Tokyo | A Study on Efficient Scalar Multiplication for Elliptic Curve Cryptosystems Naoya Terashima, Tomoko K. Matsushima, Osamu Ashihara (Polytechnic Univ.) IT2007-41 ISEC2007-138 WBS2007-72 |
Efficient elliptic curve arithmetic is crucial for cryptosystems based on elliptic curves. Such cryptosystems often requ... [more] | IT2007-41 ISEC2007-138 WBS2007-72 pp.59-66 |
|
| ISEC | 2007-12-19 14:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Efficiency Analysis of Multi-Scalar Multiplications using Direct Computation Methods Hisashi Yamada, Tsuyoshi Takagi (FUN), Kouichi Sakurai (Kyushu Univ.) ISEC2007-121 |
The most time consuming operation to verify a signature with the elliptic curve digital signature algorithm (ECDSA) i... [more] |
ISEC2007-121 pp.59-66 |
[Return to Top Page]