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 27  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
RCC, ISEC, IT, WBS 2024-03-14
11:00
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
ICD, HWS 2023-10-31
15:25
Mie  
(Primary: On-site, Secondary: Online)
CPA ToggleToggle-based Simulation against Multiplier for Pairingairing-based Cryptography
Saito Kikuoka, Ikeda Makoto (Tokyo Univ.) HWS2023-58 ICD2023-37
Pairing-based cryptography is more secure than RSA with a shorter key length, but it is computationally expensive and mo... [more] HWS2023-58 ICD2023-37
pp.20-25
SIS 2023-03-02
14:10
Chiba Chiba Institute of Technology
(Primary: On-site, Secondary: Online)
Timeout ciphers based on ID-based cryptography
Shota Oriyama, Hiroyuki Tsuji, Tomoaki Kimura (KAIT) SIS2022-45
Encryption technology has become indispensable in the information society, and although encryption technology is used fo... [more] SIS2022-45
pp.27-32
HWS, VLD 2023-03-03
14:40
Okinawa
(Primary: On-site, Secondary: Online)
Toggle-based simulation of side-channel attack against multiplier for pairing-based cryptography
Saito Kikuoka, Makoto Ikeda (Tokyo Univ.) VLD2022-109 HWS2022-80
Pairing-based cryptography is more secure than RSA with a shorter key length, but it is computationally expensive and mo... [more] VLD2022-109 HWS2022-80
pp.197-202
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
HWS, ICD [detail] 2021-10-19
16:15
Online Online Security evaluatuion of pairing-based cryptography against Special extended Number Field Sieve method
Saito Kikuoka, Makoto Ikeda (Tokyo Univ.) HWS2021-52 ICD2021-26
Pairing-based cryptography is an extension of elliptic-curve-based cryptography for applications realizing functional cr... [more] HWS2021-52 ICD2021-26
pp.57-62
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
BioX, ISEC, SITE, ICSS, EMM, HWS, IPSJ-CSEC, IPSJ-SPT [detail] 2021-07-19
13:55
Online Online Memory-saving implementation of BLS12-381 Pairing-based cryptography
Riku Anzai, Junichi Sakamoto, Zihao Song, Naoki Yoshida, Tsutomu Matsumoto (YNU) ISEC2021-11 SITE2021-5 BioX2021-12 HWS2021-11 ICSS2021-16 EMM2021-16
For smart security management of IoT systems, it is expected to utilize advanced cryptography such as identity-based enc... [more] ISEC2021-11 SITE2021-5 BioX2021-12 HWS2021-11 ICSS2021-16 EMM2021-16
pp.8-13
HWS 2021-04-12
11:15
Tokyo Tokyo University/Online
(Primary: On-site, Secondary: Online)
An Implementation of a Pairing on Cocks-Pinch Curve with Embedding Degree 6
Zihao Song, Junichi Sakamoto, Tsutomu Matsumoto (YNU) HWS2021-4
In recent years, with the proliferation of IoT devices and computer performance improvement, there are increasing expect... [more] HWS2021-4
pp.19-24
LOIS, ISEC, SITE 2020-11-06
10:30
Online Online Proposal of Optimal Curve Parameters for Pairing Computation on BLS12 Curve and Its Evaluation of Implementation
Daichi Hattori, Yuto Takahashi, Tomoya Tatara, Yuki Nanjo, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami (Okayama Univ.) ISEC2020-32 SITE2020-29 LOIS2020-12
Pairing-based cryptography is one of the popular cryptographic techniques for achieving safety and usability. Since a pa... [more] ISEC2020-32 SITE2020-29 LOIS2020-12
pp.1-6
HWS, ICD [detail] 2019-11-01
13:25
Osaka DNP Namba SS Bld. An Implementation of Tate and Ate Pairing of Embedding Degree 14
Zihao Song, Rikuya Matsumura, Yuki Nanjo, Yasuyuki Nogami, Takuya Kusaka (Okayama Univ.) HWS2019-58 ICD2019-19
Following a coming new age of IoT (Internet of Things) and tremendous growth of processing power of a personal
computer... [more]
HWS2019-58 ICD2019-19
pp.7-12
ISEC, SITE, ICSS, EMM, HWS, BioX, IPSJ-CSEC, IPSJ-SPT [detail] 2019-07-23
14:50
Kochi Kochi University of Technology An FPGA Implementation of Aggregate Signature Schemes with Pipelined Modular Multiplier
Yota Okuaki, Junichi Sakamoto, Daisuke Fujimoto, Tsutomu Matsumoto (YNU) ISEC2019-30 SITE2019-24 BioX2019-22 HWS2019-25 ICSS2019-28 EMM2019-33
Expectations for "Advanced Cryptography" are increasing in order to enhance the security of cyber physical systems and c... [more] ISEC2019-30 SITE2019-24 BioX2019-22 HWS2019-25 ICSS2019-28 EMM2019-33
pp.157-162
SITE, ISEC, LOIS 2018-11-04
15:10
Fukuoka   Pairing-based Zero-Knowledge Proof of Graph Information
Hiromi Yoshino, Toru Nakanishi (Hiroshima Univ.) ISEC2018-79 SITE2018-57 LOIS2018-39
A network provider needs to consider a method that can disclose correct information to the system user without disclosin... [more] ISEC2018-79 SITE2018-57 LOIS2018-39
pp.87-93
ISEC 2018-05-16
10:25
Tokyo Ookayama Campus, Tokyo Institute of Technology Determining BLS Curves for Pairing over Efficient Tower of Extension Field
Yuki Nanjo, Md. Al-Amin Khandaker (Okayama Univ.), Masaaki Shirase (Future Univ. Hakodate), Takuya Kusaka, Yasuyuki Nogami (Okayama Univ.) ISEC2018-2
Pairing-based cryptography (PBC) is receiving a lot of attention since it enables many innovative and multi-functional c... [more] ISEC2018-2
pp.9-16
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
IT 2016-07-29
10:15
Fukuoka Seminar House, Fukuoka Univ. A Consideration of an Efficient Calculation over the Extension Field of Degree 4 for Elliptic Curve Pairing Cryptography
Akihito Sanada (Okayama Univ.), Sylvain Duquesne (Univ. Rennes 1), Masaaki Shirase (FUN), Yasuyuki Nogami (Okayama Univ.) IT2016-29
Pairing based cryptography with BLS(Boneh-Lynn-Shacham) curve is defined over extension field of degree 24 .
Base exten... [more]
IT2016-29
pp.45-50
IT 2016-07-29
10:40
Fukuoka Seminar House, Fukuoka Univ. A Consideration of an Efficient Calculation over the Extension Field of Degree 3 for Elliptic Curve Pairing Cryptography
Yuta Kodera (Okayama Univ.), Sylvain Duquesne (Univ. Rennes 1), Masaaki Shirase (FUN), Yasuyuki Nogami (Okayama Univ.) IT2016-30
Recently, pairing based cryptography, which is one of public-key cryptographies, has been paid attention. Mathematically... [more] IT2016-30
pp.51-56
IT, ISEC, WBS 2016-03-10
14:30
Tokyo The University of Electro-Communications A Multiplier Architecture for Finite Field of 254bit-Prime Square Order Based on Pipelined 32bit Montgomery Multipliers
Yusuke Nagahama, Daisuke Fujimoto, Tsutomu Matsumoto (YNU) IT2015-116 ISEC2015-75 WBS2015-99
Bilinear Pairing is a major tool to realize advanced cryptographic functionality such as searchable encryption, aggregat... [more] IT2015-116 ISEC2015-75 WBS2015-99
pp.95-100
IT 2014-12-09
16:35
Toyama Unazuki New Otani Hotel [Invited Talk] Pairing-based cryptography with elliptic curve and vector decomposition problem
Yasuyuki Nogami (Okayama Univ.) IT2014-53
As non--symmetric public key cryptographies defined over finite field, especially extension field, elliptic curve crypto... [more] IT2014-53
pp.19-24
ISEC, IT, WBS 2014-03-11
11:25
Aichi Nagoya Univ., Higashiyama Campus A Distribution Related to The Exponentiation Inversion Problem Reduced from Fixed Argument Pairing Inversion 2 Problem over Barreto-Naehrig Curve
Shoichi Akagi, Yasuyuki Nogami (Okayama Univ.) IT2013-80 ISEC2013-109 WBS2013-69
As one of problems that guarantee the security of pairing--based cryptography, {em pairing inversion} problem is studied... [more] IT2013-80 ISEC2013-109 WBS2013-69
pp.163-168
 Results 1 - 20 of 27  /  [Next]  
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