|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCC, ISEC, IT, WBS |
2023-03-14 09:50 |
Yamaguchi |
(Primary: On-site, Secondary: Online) |
Full key recovery of RSA secret key from noisy binary GCD operation sequences Kenta Tani, Noboru Kunihiro (Univ. of Tsukuba) IT2022-74 ISEC2022-53 WBS2022-71 RCC2022-71 |
In CHES2019, Aldaya et al. reported a vulnerability of the binary GCD algorithm used in RSA key generation in OpenSSL.Fu... [more] |
IT2022-74 ISEC2022-53 WBS2022-71 RCC2022-71 pp.41-48 |
SDM, ICD, ITE-IST [detail] |
2017-08-02 11:35 |
Hokkaido |
Hokkaido-Univ. Multimedia Education Bldg. |
Gate Controlled Diode Characteristics of Super Steep Subthreshold slope PN-Body Tied SOI-FET for high Efficiency RF Energy Harvesting Shun Momose, Jiro Ida, Takayuki Mori, Takahiro Yoshida, Junpei Iwata, Takashi Horii, Takahiro Furuta, Takuya Yamada, Daichi Takamatsu, Kenji Itoh (KIT), Koichiro Ishibashi (UEC), Yasuo Arai (KEK) SDM2017-45 ICD2017-33 |
The gate controlled diode characteristics with our newly super steep subthreshold slope (SS) “PN-Bode Tied SOI FET” was ... [more] |
SDM2017-45 ICD2017-33 pp.109-114 |
EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] |
2016-07-15 14:30 |
Yamaguchi |
|
Algebraic Surface Cryptosystems using Polynomial Approximate GCD Yuichi Komano, Koichiro Akiyama (Toshiba), Yasuhiro Goto (Hokkaido Univ. of Education), Koji Nuida, Goichiro Hanaoka (AIST) ISEC2016-35 SITE2016-29 ICSS2016-35 EMM2016-43 |
Since the original proposal in 2004, several attacks have been reported against algebraic surface cryptosystems. This re... [more] |
ISEC2016-35 SITE2016-29 ICSS2016-35 EMM2016-43 pp.217-222 |
EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] |
2012-07-20 14:20 |
Hokkaido |
|
An Improved Algorithm for Approximate GCD Problems Atsushi Takayasu, Noboru Kunihiro (UT) ISEC2012-35 SITE2012-31 ICSS2012-37 EMM2012-27 |
In this paper, we analyze multivariate approximate common divisor problem(ACDP), given approximate multiples of the inte... [more] |
ISEC2012-35 SITE2012-31 ICSS2012-37 EMM2012-27 pp.189-194 |
ISEC |
2004-09-17 13:25 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A trial of GNFS implementation (Part VI)
-- lattice sieve -- Kazumaro Aoki, Hiroki Ueda (NTT), Yuji Kida (Rikkyo Univ.) |
The number field sieve is considered as the fastest algorithm for factoring an integer which does not include small fact... [more] |
ISEC2004-68 pp.9-14 |
|
|
|
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]
|