| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| VLD, HWS, ICD | 2024-03-02 12:05 |
Okinawa | (Primary: On-site, Secondary: Online) |
A Study on formal verification of GF(2^m) arithmetic circuits including states Kazuho Sakoda (SCU/Kobe Univ.), Yasuyoshi Uemura (SCU), Naofumi Homma (Tohoku Univ.)  VLD2023-140 HWS2023-100 ICD2023-129 |
This paper describes a formal verification method for arithmetic circuits based on computer algebra. Conventional method... [more] | VLD2023-140 HWS2023-100 ICD2023-129 pp.215-220 |
| CCS, NLP | 2020-06-05 14:25 |
Online | Online | Note on the Discrete Fourier Transform on the Galois Extension Field GF(2^q) Ryota Yamagata, Ibuki Nakamura, Hisato Fujisaka (Hiroshima City Univ.) NLP2020-17 CCS2020-7 |
In this manuscript, the discrete Fourier transform on a Galois extension field GF($2^q$) is discussed. A efficient discr... [more] | NLP2020-17 CCS2020-7 pp.33-34 |
| ISEC, SITE, ICSS, EMM, HWS, BioX, IPSJ-CSEC, IPSJ-SPT [detail] | 2019-07-23 13:10 |
Kochi | Kochi University of Technology | A Formal Approach to Verifying Trojan-freeness of Cryptographic Circuits Based on Galois-Field Arithmetic Akira Ito, Rei Ueno, Naofumi Homma (Tohoku Univ.) ISEC2019-26 SITE2019-20 BioX2019-18 HWS2019-21 ICSS2019-24 EMM2019-29 |
This paper proposes a formal method for verifying whether Hardware Trojan (HT) exists or not (i.e., HT-freeness) in cryp... [more] | ISEC2019-26 SITE2019-20 BioX2019-18 HWS2019-21 ICSS2019-24 EMM2019-29 pp.133-138 |
| HWS | 2019-04-12 14:20 |
Miyagi | Tohoku University | Design of Unified Hardware Architecture for GF-Arithmetic Authenticated Encryption Schemes Shotaro Sawataishi, Rei Ueno, Naofumi Homma (Tohoku Univ.) HWS2019-3 |
This paper presents an efficient unified hardware for several authenticated encryption schemes based on Galois-field (GF... [more] | HWS2019-3 pp.13-18 |
| ISEC, LOIS, SITE | 2014-11-21 14:40 |
Hyogo | Elliptic curves subjected to the GHS attack over prime degree extension fields in odd characteristic Tsutomu Iijima (Koden), Jinhui Chao (Chuo Univ) ISEC2014-59 SITE2014-50 LOIS2014-29 |
One of the most powerful attacks to elliptic curve and hyperelliptic based cryptosystems defined over an extension of a ... [more] | ISEC2014-59 SITE2014-50 LOIS2014-29 pp.19-26 |
|
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2008-11-17 15:25 |
Fukuoka | Kitakyushu Science and Research Park | Hardware Algorithm for Division in GF(2^m) Based on the Extended Euclid's Algorithm Accelerated with Parallelization of Modular Reductions Katsuki Kobayashi, Naofumi Takagi (Nagoya Univ.) VLD2008-65 DC2008-33 |
We propose a fast hardware algorithm for division in GF(2^m). It is based on the extended Euclid's algorithm and requir... [more] | VLD2008-65 DC2008-33 pp.31-36 |
| VLD, CPSY, RECONF, DC, IPSJ-SLDM, IPSJ-ARC (Joint) [detail] |
2007-11-20 11:20 |
Fukuoka | Kitakyushu International Conference Center | Proposal of domino-RSL circuit which is resistant to Differential Power Analysis attack on cryptographic circuit Yoshinobu Toyoda, Kenta Kido, Yoshiaki Shitabayashi, Takeshi Fujino (Ritsumeikan Univ.) VLD2007-77 DC2007-32 |
Countermeasures against Side Channel Attack are necessary to achieve cryptographic circuit that has tamper resistance. M... [more] | VLD2007-77 DC2007-32 pp.43-48 |
| ICD, VLD | 2007-03-09 09:20 |
Okinawa | Mielparque Okinawa | A Combined Circuit for Multiplication and Inversion in GF(2^m) Based on the Extended Euclid's Algorithm Katsuki Kobayashi, Naofumi Takagi (Nagoya Univ.) |
A combined circuit for multiplication and inversion in $\mathrm{GF}(2^m)$ is proposed. In contrast with previously pr... [more] |
VLD2006-142 ICD2006-233 pp.13-18 |
| WBS, IT, ISEC | 2006-03-16 13:15 |
Aichi | Nagoya Univ. | [Invited Talk]
Acceleration of arithmetic in Galois fields by hardware support Naofumi Takagi (Nagoya Univ.) |
In encryption and decryption of public-key cryptographies, such as elliptic curve cryptography (ECC), computation of ari... [more] | IT2005-72 ISEC2005-129 WBS2005-86 p.49 |
| VLD, ICD, DC, IPSJ-SLDM | 2005-12-02 10:20 |
Fukuoka | Kitakyushu International Conference Center | A Note on Expansion of Convolutional Compactors on Galois Field Masayuki Arai, Satoshi Fukumoto, Kazuhiko Iwasaki (Tokyo Metro. Univ.) |
Convolutional compactors offer a promising technique of compacting test responses. In this study we expand the architect... [more] | VLD2005-78 ICD2005-173 DC2005-55 pp.13-18 |
| WBS | 2005-10-28 10:30 |
Shizuoka | Shizuoka University (Hamamatsu Campus) | On the Construction of Codes over GF(pm) for Synchronous Optical CDMA Systems Tomoko K. Matsushima (Polytechnic Univ.), Noboru Ochiai (CSE), Takeshi Nagao (Sansou Systems), Yasuaki Teramachi (Polytechnic Univ.) |
In this paper, a new class of signature codes for synchronous optical CDMA systems is proposed. The proposed codes are c... [more] | WBS2005-39 pp.1-6 |
| ISEC, LOIS | 2004-11-08 13:55 |
Osaka | Osaka Univ. | A Reconfigurable Dual-Field Multiplier for GF(P) and GF(2n) Ryo Namba, Masaru Takesue (Hosei Univ) |
This paper proposes a dual-field multiplier for the cryptographic system on GF(P) and GF(2^n) both with multiple key-siz... [more] | ISEC2004-79 OIS2004-46 pp.7-12 |
[Return to Top Page]