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 37  /  [Next]  
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
CPSY, IPSJ-ARC, IPSJ-HPC 2023-12-05
17:40
Okinawa Okinawa Industry Support Center
(Primary: On-site, Secondary: Online)
Evaluation of conversion overheads for the sparse matrix format appliying indices of the non-zero elements dictionary compression to accelerate SpMV on GPU
Shun Murakami (JAIST), Kazunori Yoneda, Iwamura Takashi, Masahiro Watanabe (Fujitsu Japan), Yasushi Inoguchi (JAIST) CPSY2023-31
In recent years, as numerical simulations have become increasingly complex and large-scale. There is a growing demand fo... [more] CPSY2023-31
pp.25-30
RECONF 2023-06-09
14:30
Kochi Eikokuji Campus, Kochi University of Technology
(Primary: On-site, Secondary: Online)
An Extension of the Karatsuba Algorithm in Case that the Bit Widths of the Multiplicand and Multiplier are Different
Susumu Yamazaki (Univ. of Kitakyushu) RECONF2023-11
The order of the number of multiplications required for bignum multiplication is O(n2) for the usual method and O(n log_... [more] RECONF2023-11
pp.58-61
QIT
(2nd)
2022-12-09
18:00
Kanagawa Keio Univ.
(Primary: On-site, Secondary: Online)
Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform
Kento Oonishi (MELCO), Noboru Kunihiro (UTsukuba)
Shor's algorithm solves the integer factoring and the discrete logarithm problems in polynomial time. Therefore, the eva... [more]
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
SDM, ICD, ITE-IST [detail] 2021-08-18
13:45
Online Online Performance Evaluation of Serial-Parallel Montgomery Multipliers for RNS
Hiroyuki Tsubouchi, Mitsunaga Kinjo, Katsuhiko Shimabukuro (Univ. of the Ryukyus) SDM2021-40 ICD2021-11
Modulo operations are required in RNS (Residue Number System) which enables to perform highly parallel computation. Also... [more] SDM2021-40 ICD2021-11
pp.54-57
CPSY, DC, IPSJ-ARC [detail] 2021-07-21
10:15
Online Online Lossy Error Correction Coding for Vector-Matrix Multiplication
Leo Otani, Haruhiko Kaneko (Tokyo Tech) CPSY2021-7 DC2021-7
Error control codes are effective to improve the reliability and precision of the vector-matrix multiplications executed... [more] CPSY2021-7 DC2021-7
pp.37-42
HWS, VLD [detail] 2021-03-03
13:00
Online Online [Memorial Lecture] Scheduling Sparse Matrix-Vector Multiplication onto Parallel Communication Architecture
Mingfei Yu, Ruitao Gao, Masahiro Fujita (Univ. Tokyo) VLD2020-71 HWS2020-46
There is an obvious trend to make use of hardware including many-core CPU, GPU and FPGA, to conduct computationally inte... [more] VLD2020-71 HWS2020-46
pp.24-29
SP, EA, SIP 2020-03-02
10:35
Okinawa Okinawa Industry Support Center
(Cancelled but technical report was issued)
Dimension reduction without multiplication in machine learning
Nobutaka Ono (TMU) EA2019-104 SIP2019-106 SP2019-53
In this study, we propose a dimension reduction method for machine learning by only selecting elements without multiplic... [more] EA2019-104 SIP2019-106 SP2019-53
pp.21-26
HWS, ICD [detail] 2019-11-01
14:15
Osaka DNP Namba SS Bld. A Design of Isogeny-Based Cryptographic Hardware Architecture Using Residue Number System
Shuto Funakoshi, Rei Ueno, Naofumi Homma (Tohoku Univ.) HWS2019-60 ICD2019-21
In this paper, we will propose an efficient hardware architecture of isogeny-based cryptography. The proposed architectu... [more] HWS2019-60 ICD2019-21
pp.19-24
CPSY, DC, IPSJ-ARC [detail] 2019-07-25
13:55
Hokkaido Kitami Civic Hall A Study on Multiple-error Correction for Matrix-Product Computation Using Steiner Triple System
Yuki Katsu, Haruhiko Kaneko (Tokyo Tech) CPSY2019-26 DC2019-26
Improving the reliability of matrix multiplication is a very important factor for the technologies in which matrix multi... [more] CPSY2019-26 DC2019-26
pp.123-127
ISEC, SITE, ICSS, EMM, HWS, BioX, IPSJ-CSEC, IPSJ-SPT [detail] 2019-07-24
13:45
Kochi Kochi University of Technology Design Space Search Applying Bayesian Optimization to High-level Design Flow
Ryohei Nakayama (UTokyo), Hiromitsu Awano (Osaka Univ.), Makoto Ikeda (UTokyo) ISEC2019-57 SITE2019-51 BioX2019-49 HWS2019-52 ICSS2019-55 EMM2019-60
Now that circuit scale is increasing, high-level synthesis technology that designs circuits using high-level programming... [more] ISEC2019-57 SITE2019-51 BioX2019-49 HWS2019-52 ICSS2019-55 EMM2019-60
pp.369-374
HWS, ICD 2018-10-29
14:55
Osaka Kobe Univ. Umeda Intelligent Laboratory Selection and evaluation of optimal bases in the case of implementing Q-RNS MR algorithm in FPGA
Yoshihiro Kori, Daisuke Fujimoto, Yu-ichi Hayasi (NAIST), Naofumi Homma (Tohoku Univ.) HWS2018-51 ICD2018-43
To improve a computation speed of public cryptography, Montgomery Reduction(MR) and Residue Number System (RNS) are ofte... [more] HWS2018-51 ICD2018-43
pp.25-30
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
SRW 2016-06-13
13:55
Kanagawa NICT Wireless Network Research Institute (NICT) Improvement of Detection Sensitivity for BPSK Signals
Tatsuya Kikuzuki, Akihiro Wada, Teruhisa Ninomiya (Fujitsu Labs.) SRW2016-28
As IoT (Internet of Things) systems become widespread, data communication may often be disturbed because of radio freque... [more] SRW2016-28
pp.15-20
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
EE, WPT
(Joint)
2014-11-19
10:00
Kyoto Doshisha University Analysis of MHz Power Supply Constructed from Frequency Multiplying Circuit with Series Resonance
Koji Orikawa, Jun-ichi Itoh (Nagaoka Univ. of Tech.) WPT2014-57
This paper proposes a high-frequency inverter which outputs MHz band frequency using a multiplying frequency method. The... [more] WPT2014-57
pp.37-42
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
IN, RCS
(Joint)
2014-05-16
15:45
Tokyo Kikai-Shinko-Kaikan Bldg. A Study of Four-layered SSB-QAM Modulation Method (Part 2) -- A Theoretical Analysis on BER characteristics in AWGN Environment --
Gen-ichiro Ohta, Takuro Sato (Waseda Univ.) RCS2014-31
For authors’ study of SSB-QPSK, a new detection method is invented. Using this means, the ISI (Inter- Symbol-Interferenc... [more] RCS2014-31
pp.67-72
 Results 1 - 20 of 37  /  [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