IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 20  /   
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 2023-03-14
09:25
Yamaguchi
(Primary: On-site, Secondary: Online)
Security Anslysis of binary elliptic curve GLS254
Yue Gao (Osaka Univ.), ShuFan Wu (Taiwan Univ.), Atsuko Miyaji (Osaka Univ.) IT2022-73 ISEC2022-52 WBS2022-70 RCC2022-70
In now days, light weight system like Iot(Internet of Things) and FPGA have attracted many researchers and have applied... [more] IT2022-73 ISEC2022-52 WBS2022-70 RCC2022-70
pp.33-40
SITE, ISEC, HWS, EMM, BioX, IPSJ-CSEC, IPSJ-SPT, ICSS [detail] 2020-07-21
16:35
Online Online Secure and Compact Elliptic Curve LR Scalar Multiplication
Yaoan Jin, Atsuko Miyaji (Osaka Univ) ISEC2020-31 SITE2020-28 BioX2020-34 HWS2020-24 ICSS2020-18 EMM2020-28
Elliptic curve cryptography (ECC) can ensure an equivalent security with much smaller key sizes. Elliptic curve scalar m... [more] ISEC2020-31 SITE2020-28 BioX2020-34 HWS2020-24 ICSS2020-18 EMM2020-28
pp.111-118
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
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
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 2012-05-18
13:50
Tokyo Kikai-Shinko-Kaikan Bldg. A Note on Efficient Software Implementation of the Scalar Multiplication over Barreto-Naehrig Curves
Tadanori Teruya, Naoki Kanayama, Eiji Okamoto (Univ. of Tsukuba) ISEC2012-3
In this paper, we describe a design of efficient software implementation of the scalar multiplication over the subgroup,... [more] ISEC2012-3
pp.11-18
IT, ISEC, WBS 2012-03-02
09:50
Kanagawa   Improved Left-to-Right Scalar Multiplication Algorithms
Atsuko Miyaji, Yiren Mo (JAIST) IT2011-69 ISEC2011-96 WBS2011-70
In 1987, Peter L. Montgomery proposed a left-to-right scalar multiplication algorithm to make the scalar multiplication ... [more] IT2011-69 ISEC2011-96 WBS2011-70
pp.141-148
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 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 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
ISEC, SITE, IPSJ-CSEC 2007-07-20
13:50
Hokkaido Future University-Hakodate Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography
Erik Dahmen (TUDarmstadt), Katsuyuki Okeya (Hitachi), Daniel Schepers (TUDarmstadt) ISEC2007-57
This paper presents a new approach to precompute all odd points [3]P, [5]P,..., [2k-1]P, k >= 2 on an elliptic curve ove... [more] ISEC2007-57
pp.81-88
ISEC 2007-05-18
15:10
Tokyo Kikai-Shinko-Kaikan Bldg. A multiplication formula on degenerate divisors of genus 4 hyperelliptic curves
Naoki Kanayama, Takehiro Yamaguchi, Takeshi Okamoto, Eiji Okamoto (Tsukuba Univ.) ISEC2007-11
We show an pairing-friendly genus 4 hyperelliptic curve over finite fields of characteristic 2 and prove an scalar multi... [more] ISEC2007-11
pp.69-76
 Results 1 - 20 of 20  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan