| 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 # | |
| RCC, ISEC, IT, WBS | 2024-03-14 09:55 |
Osaka | Osaka Univ. (Suita Campus) | A generalization of ISD algorithm for Syndrome Decoding Problem Asuka Wakasugi (EAGLYS), Tada Mitsuru (Chiba Univ.)  IT2023-106 ISEC2023-105 WBS2023-94 RCC2023-88 |
The Information Set Decoding (ISD) algorithm is the best-known decoding algorithm for the syndrome decoding problem, whi... [more] | IT2023-106 ISEC2023-105 WBS2023-94 RCC2023-88 pp.205-211 |
| ISEC | 2020-05-20 10:45 |
Online | Online | Improved Quantum Information Set Decoding Algorithm with Low Memory Naoto Kimura (Univ. Tokyo), Atsushi Takayasu (NICT), Tsuyoshi Takagi (Univ. Tokyo) ISEC2020-3 |
The security of code-based cryptoststems relates to the hardness of the syndrome decoding problem. The best decoding alg... [more] | ISEC2020-3 pp.15-22 |
| ICSS | 2018-11-22 10:50 |
Kagoshima | Identification Scheme Based on the Binary Syndrome Decoding Problem Using High Density Parity Check Codes Haruka Ito, Masanori Hirotomo (Saga Univ.), Youji Fukuta (Kindai Univ.), Masami Mohri (Gifu Univ.), Yoshiaki Shiraishi (Kobe Univ.) ICSS2018-62 |
Most of the currently used identification schemes can not be safely used if factoring factorization and discrete logarit... [more] | ICSS2018-62 pp.49-54 |
|
| ISEC | 2017-09-04 15:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Provably Secure Code-Based Signature Schemes via Fiat-Shamir Transform with Theoretical and Practical Analysis on Hash Encodings Taiyo Yamaguchi, Bagus Santoso (UEC) ISEC2017-46 |
In this paper, we propose signature schemes constructed from code-based identification scheme proposed by Stern via Fiat... [more] | ISEC2017-46 pp.35-42 |
| IT | 2015-09-04 09:25 |
Ishikawa | Hakusan Shobutei | On the Decoding Problem of Algebraic Codes over Symbol-Pair Read Channels Makoto Takita (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2015-35 |
In this paper, we discuss a decoding problem of algebraic codes over symbol-pair read channels. The channels output ove... [more] |
IT2015-35 pp.7-12 |
| ISEC, IT, WBS | 2014-03-10 14:10 |
Aichi | Nagoya Univ., Higashiyama Campus | Syndrome Decoding of Symbol-Pair Codes Makoto Takita (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2013-67 ISEC2013-96 WBS2013-56 |
Cassuto and Blaum proposed new error correcting codes which are called symbol-pair codes. They gave a coding framework f... [more] | IT2013-67 ISEC2013-96 WBS2013-56 pp.81-86 |
| IT | 2013-09-27 14:55 |
Okinawa | Culture Resort Festone (Okinawa) | Number of operations of parallel decoder for q-ary Hamming codes Reiya Ooshima, Ken-ichi Iwata (Univ. of Fukui) IT2013-40 |
We consider the number of addition operations of parallel decoder to calculate an error syndrome for $q$-ary $left(frac{... [more] | IT2013-40 pp.49-54 |
| IT | 2004-09-17 10:00 |
Osaka | Osaka Sangyo Univ. | Notes on Error-Correcting Capability of a Class of Subalphabet Subcodes of Reed-Solomon Codes Yoshiyuki Ito, Kin-ichiroh Tokiwa (Osaka Sangyo Univ.) |
A subspace subcode of Reed-Solomon(SSRS) code is defined as a subset of a Reed-Solomon(RS) code over GF($2^m$) which con... [more] | IT2004-38 pp.1-6 |
[Return to Top Page]