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 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] 2022-07-20
15:25		 Online Online An Efficient Sparse Multiplication Algorithm For Pairing-Friendly Elliptic Curves With Cubic Twist
Daiki Hayashida, Kenichiro Hayasaka (Mitsubishi Electric Corp.), Tadanori Teruya (AIST) ISEC2022-26 SITE2022-30 BioX2022-51 HWS2022-26 ICSS2022-34 EMM2022-34		 In this paper, we propose an efficient sparse multiplication algorithm on elliptic curves with cubic twist based on the ... [more] ISEC2022-26 SITE2022-30 BioX2022-51 HWS2022-26 ICSS2022-34 EMM2022-34
pp.110-117
BioX, ISEC, SITE, ICSS, EMM, HWS, IPSJ-CSEC, IPSJ-SPT [detail] 2021-07-19
13:30		 Online Online Fundamental Study on Acceleration of Inversion using Binary Extended Euclidean Algorithm for Pairing Computation in RNS Representation
Kota Morimoto, Daisuke Fujimoto, Saki Osuka (NAIST), Shinichi Kawamura, Tadanori Teruya (AIST), Yuichi hayashi (NAIST) ISEC2021-10 SITE2021-4 BioX2021-11 HWS2021-10 ICSS2021-15 EMM2021-15		 Pairing computation is an essential tool in advanced cryptography, and Yao et al. have shown that a hardware implementat... [more] ISEC2021-10 SITE2021-4 BioX2021-11 HWS2021-10 ICSS2021-15 EMM2021-15
pp.1-7
ICSS 2014-11-27
16:00		 Miyagi Tohoku Gakuin University (Tagajo Campus) Efficient Computation of Weil Pairing over Supersingular Elliptic Curve and Its Evaluation
Kazuma Tanaka (Univ. of Tsukuba), Tadanori Teruya (AIST), Naoki Kanayama, Takashi Nishide, Eiji Okamoto (Univ. of Tsukuba) ICSS2014-56		 In SCIS 2014, the authors considered efficiency of computing symmetric parings on supersingular elliptic curves over fin... [more] ICSS2014-56
pp.31-36
ISEC 2012-09-21
09:45		 Tokyo Kikai-Shinko-Kaikan Bldg. Computation of pairings and scalar multiplication by using elliptic nets over small characteristic finite fields
Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka Saito, Tadanori Teruya (Univ. of Tsukuba), Shigenori Uchiyama (Tokyo Metro Univ.) ISEC2012-44		  [more] ISEC2012-44
pp.7-13
EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] 2012-07-20
15:25		 Hokkaido   Efficient elliptic curve scalar multiplication using an elliptic net algorithm
Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka Saito, Tadanori Teruya (Univ. of Tsukuba), Shigenori Uchiyama (Tokyo Metro Univ.) ISEC2012-37 SITE2012-33 ICSS2012-39 EMM2012-29		  [more] ISEC2012-37 SITE2012-33 ICSS2012-39 EMM2012-29
pp.201-206
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
 Results 1 - 6 of 6  /   
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