Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ISEC |
2020-05-20 13:10 |
Online |
Online |
[Invited Talk]
An Efficient F4-style Based Algorithm to Solve MQ Problems (from IWSEC 2019) Takuma Ito, Naoyuki shinohara (NICT), Shigenori Uchiyama (TMU) ISEC2020-5 |
We introduce “An Efficient F4-style Based Algorithm to Solve MQ Problems”we presented in IWSEC 2019. [more] |
ISEC2020-5 p.25 |
IPSJ-SLDM, RECONF, VLD, CPSY, IPSJ-ARC [detail] |
2020-01-24 14:45 |
Kanagawa |
Raiosha, Hiyoshi Campus, Keio University |
Partial synthesis method based on Column-wise verification for integer multipliers Jian Gu, Amir Masoud Gharehbaghi, Masahiro Fujita (UTokyo) VLD2019-89 CPSY2019-87 RECONF2019-79 |
Partial logic synthesis is a method that most parts of the target circuits are fixed and the missing portions can be log... [more] |
VLD2019-89 CPSY2019-87 RECONF2019-79 pp.211-216 |
WBS, IT, ISEC |
2018-03-09 16:10 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Attacks on several Multivariate PKCs
-- Attack on K(AVII)MVPKC -- Ryuichi Sakai (Osaka Electro-Communication Univ.), Masao Kasahara (Waseda Univ.) IT2017-138 ISEC2017-126 WBS2017-119 |
One of the anthers, Kasahara, have been proposed several public key cryptosystems based on multivariate polynomials wit... [more] |
IT2017-138 ISEC2017-126 WBS2017-119 pp.207-212 |
EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] |
2016-07-15 13:50 |
Yamaguchi |
|
On the Semi-regularity of Polynomial Systems Arising from the Section Finding Problem Shinya Okumura (ISIT), Koichiro Akiyama (Toshiba), Tsuyoshi Takagi (Kyushu Univ.) ISEC2016-34 SITE2016-28 ICSS2016-34 EMM2016-42 |
There are no known quantum algorithms, performed in polynomial time, for solving the section finding problem on algebrai... [more] |
ISEC2016-34 SITE2016-28 ICSS2016-34 EMM2016-42 pp.185-191 |
IT |
2014-09-19 09:00 |
Chiba |
|
Fast Decoding Algorithm for Projective Reed-Muller Codes and Its Computational Complexity Norihiro Nakashima, Hajime Matsui (Toyota Tech. Inst.) IT2014-41 |
Projective Reed--Muller (RM) codes were introduced as a generalization of RM codes, and the lowest wight and the dual co... [more] |
IT2014-41 pp.1-6 |
ISEC |
2011-09-09 15:55 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Public Key Cryptosystems Constructed Based on Reed-Solomon Codes and Pseudo Cyclic Codes, K(IX)SE(1)PKC and K(X)SE(1)PKC, Realizing Coding Rate of Exactly 1.0 Masao Kasahara (Osaka Gakuin Univ.) ISEC2011-31 |
In this paper, we present a new class of public-key cryptosystems, K(IX)SE(1)PKC and K(X)SE(1)PKC realizing the coding r... [more] |
ISEC2011-31 pp.29-35 |
ISEC, IPSJ-CSEC, SITE, ICSS, EMM, IPSJ-SPT [detail] |
2011-07-13 14:30 |
Shizuoka |
Shizuoka University |
Public Key Cryptosystems Constructed Based on Cyclic Codes, Realizing Coding Rate of Exactly 1.0, K(XI)SE(g)PKC and K(XII)SE(g)PKC Masao Kasahara (Osaka Gakuin Univ.) ISEC2011-23 SITE2011-20 ICSS2011-28 EMM2011-22 |
In this paper, we first present a new class of public-key cryptosystems, K(\ix)SE(1)PKC based on error-correcting codes ... [more] |
ISEC2011-23 SITE2011-20 ICSS2011-28 EMM2011-22 pp.131-136 |
ISEC, IT, WBS |
2011-03-04 13:50 |
Osaka |
Osaka University |
Public Key Cryptosystems Constructed Based on Pseudo Cyclic Codes, K(VIII)SE(1)PKC and K(XI)SE(2)PKC
-- Modification of K(VII)SE(1)PKC -- Masao Kasahara (Osaka Gakuin Univ.) IT2010-125 ISEC2010-129 WBS2010-104 |
In this paper, we present a new class of public-key cryptosystems, K(VIII)SE(1)PKC and K(XI)SE(2)PKC based on error-corr... [more] |
IT2010-125 ISEC2010-129 WBS2010-104 pp.377-382 |