| 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-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) | Public-Key Identification Scheme Based on a New NP-Hard Tensor Problem Akitaka Yokota, Bagus Santoso (UEC)  IT2023-90 ISEC2023-89 WBS2023-78 RCC2023-72 |
No general quantum algorithm is known to efficiently solve computational problems based on Multivariate Quadratic Poly... [more] |
IT2023-90 ISEC2023-89 WBS2023-78 RCC2023-72 pp.94-101 |
| RCC, ISEC, IT, WBS | 2024-03-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) | Partial Key Exposure Attacks on UOV-like Signatures Yuki Seto, Hiroki Furue, Atsushi Takayasu (UTokyo) IT2023-104 ISEC2023-103 WBS2023-92 RCC2023-86 |
NIST is currently working on the standardization of post-quantum cryptography (PQC). Forty signature schemes were submit... [more] | IT2023-104 ISEC2023-103 WBS2023-92 RCC2023-86 pp.189-196 |
| ICTSSL, CAS | 2024-01-25 11:30 |
Kanagawa | (Primary: On-site, Secondary: Online) |
On an approximation of images by means of bivariate polynomials JiaHang Chang, Kazuya Ozawa, Kaito Isogai, Hideaki Okazaki (SIT) CAS2023-87 ICTSSL2023-40 |
In this report, we construct the inequality condition problem of approximating a bivariate polynomial of an image as a K... [more] | CAS2023-87 ICTSSL2023-40 pp.26-30 |
| SIP, IT, RCS | 2024-01-18 13:15 |
Miyagi | (Primary: On-site, Secondary: Online) |
[Invited Talk]
A Revisit to Proximal Decoding for LDPC codes Tadashi Wadayama (NiTech) IT2023-42 SIP2023-75 RCS2023-217 |
In this invited talk, our proposed algorithm, {em proximal decoding}, is revisited and some optimization-based decodi... [more] |
IT2023-42 SIP2023-75 RCS2023-217 p.68 |
| COMP | 2023-10-24 13:30 |
Aichi | Nagoya Univ. Venture Business Lab. | An algorithm for the secure total domination problem in proper interval graphs Toru Araki, Yasufumi Aita (Gunma Univ.) COMP2023-11 |
A subset $S$ of vertices of $G$ is a total dominating set if, for any vertex $v$, there is a vertex in $S$ adjacent to $... [more] | COMP2023-11 pp.1-8 |
| R | 2023-09-28 15:20 |
Fukuoka | (Primary: On-site, Secondary: Online) |
Polynomial Failure Models: Theory and Applications Tadashi Dohi, Hiroyuki Okamura (Hiroshima Univ.) R2023-41 |
In this paper we summarize two polynomial failure models, where the lifetime distributions are described by canonical po... [more] | R2023-41 pp.22-27 |
| EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2023-07-24 18:00 |
Hokkaido | Hokkaido Jichiro Kaikan | A security analysis on MQ-Sign submitted to Korean Post-Quantum Cryptography standardization Yasuhiko Ikematsu (Kyushu Univ.), Hyungrok Jo (YNU), Takanori Yasuda (OUS) ISEC2023-31 SITE2023-25 BioX2023-34 HWS2023-31 ICSS2023-28 EMM2023-31 |
MQ-Sign is a variant of the UOV singature scheme proposed by Shim et al. It has been suggested as a candidate for the st... [more] | ISEC2023-31 SITE2023-25 BioX2023-34 HWS2023-31 ICSS2023-28 EMM2023-31 pp.113-118 |
| CCS, NLP | 2023-06-09 14:20 |
Tokyo | Tokyo City Univ. | Sequence period of sequences generated by fourth-order reccurence relations with two variables over Z 2k Daisaburo Yoshioka (Sojo Univ.) NLP2023-25 CCS2023-13 |
In recent years, a public-key cryptosystem based on Chebyshev polynomials over the residue ring of modulo 2k has been pr... [more] | NLP2023-25 CCS2023-13 pp.53-56 |
| RCC, ISEC, IT, WBS | 2023-03-14 13:25 |
Yamaguchi | (Primary: On-site, Secondary: Online) |
Signature scheme based on OSIDH Kohtaroh Aoyagi (TUT), Hiroki Minamide (NITTC), Koutarou Suzuki (TUT) IT2022-90 ISEC2022-69 WBS2022-87 RCC2022-87 |
Isogeny-based cryptography, post-quantum cryptography, is a cryptographic technique that has attracted attention because... [more] | IT2022-90 ISEC2022-69 WBS2022-87 RCC2022-87 pp.135-141 |
| COMP | 2023-03-02 14:45 |
Tokyo | Ochanomizu University | Correcting the algorithm for a minimum secure dominating set of proper interval graphs Toru Araki, Ryuya Saito (Gunma Univ.) COMP2022-36 |
In [A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics 260 (2019) 289--293... [more] | COMP2022-36 pp.16-20 |
| ICTSSL, CAS | 2023-01-26 11:15 |
Tokyo | TBD (Primary: On-site, Secondary: Online) |
On Image Recognition Neural Networks and Polynomial Approximation of Images Jiahang Chang, Kazuya Ozawa, Hideaki Okazaki (SIT) CAS2022-66 ICTSSL2022-30 |
In this report, we present a convolutional neural network that we have built ourselves for our research. Then, we discus... [more] | CAS2022-66 ICTSSL2022-30 pp.23-27 |
| EST | 2023-01-26 15:20 |
Okinawa | (Primary: On-site, Secondary: Online) |
Statistical Analysis of Multiconductor Non-Uniform Transmission Line with Variations in Line Height and Line gap using Polynomial Chaos Methods Yuto Hachiga, Yoshiki Kayano, Yoshio Kami, Fengchao Xiao (UEC) EST2022-85 |
Monte Carlo (MC) method, which is commonly used in a statistical analysis, can perform highly accurate calculations, but... [more] | EST2022-85 pp.58-63 |
| COMP | 2022-10-26 11:45 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Evacuation problems on grid networks with uniform transit time and uniform capacity Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh) COMP2022-15 |
We consider the problem of finding the minimum time at which all supplies on a dynamic flow network can reach the demand... [more] | COMP2022-15 pp.7-13 |
| COMP | 2022-10-26 14:30 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) COMP2022-17 |
In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] | COMP2022-17 pp.21-28 |
| R | 2022-10-07 14:25 |
Fukuoka | (Primary: On-site, Secondary: Online) |
A note on Polynomial Software Reliability Models Siqiao Li, Tadashi Dohi, Hiroyuki Okamura (Hiroshima Univ.) R2022-35 |
In this article, we propose two novel non-homogeneous Poisson process (NHPP)-based software reliability models (SRMs), c... [more] | R2022-35 pp.19-24 |
| SIP | 2022-08-25 13:03 |
Okinawa | Nobumoto Ohama Memorial Hall (Ishigaki Island) (Primary: On-site, Secondary: Online) |
Computational Cost Reduction in 1-Dimensional Null Space Estimation of Noisy Structured Matrices Natsuki Yoshino, Akira Tanaka (Hokudai) SIP2022-51 |
The structured total least norm method has been proposed for estimating the one-dimensional null space of structured mat... [more] | SIP2022-51 pp.7-12 |
| NLP | 2022-08-02 09:50 |
Online | Online | Characteristics of degree period of commutative polynomials defined by fourth-order recurrence relations with two variables over Z2K Takuma Nishizaka, Daisaburo Yoshioka (Sojo Univ.) NLP2022-28 |
In recent years, a public-key cryptosystem based on Chebyshev polynomials over Z_{2^k} has been presented. Unfortunately... [more] | NLP2022-28 pp.11-14 |
| VLD, HWS [detail] | 2022-03-07 11:25 |
Online | Online | Design and Measurement of Crypto Processor for Post Quantum Cryptography CRYSTALS-Kyber Taishin Shimada, Makoto Ikeda (Univ. of Tokyo) VLD2021-81 HWS2021-58 |
CRYSTALS-Kyber is one of the public key cryptosystems being considered as a public key cryptosystem after the advent of ... [more] | VLD2021-81 HWS2021-58 pp.31-36 |
| NLP, MICT, MBE, NC (Joint) [detail] |
2022-01-23 10:15 |
Online | Online | A simple method for estimating phase and amplitude functions of limit-cycle oscillators by polynomial regression from time series data Norihisa Namura, Hiroya Nakao (Tokyo Tech.) NLP2021-122 MICT2021-97 MBE2021-83 |
In the real world, there are various nonlinear rhythmic phenomena, many of which can be modeled mathematically as limit-... [more] | NLP2021-122 MICT2021-97 MBE2021-83 pp.237-242 |
| COMP | 2021-12-03 | Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Polynomial-time Extraction of the Maximum Clique Using Eigenvalue Relation Yasunori Ohto |
We prove that the maximum clique problem can be solved in polynomial time. First, we prove the relationship between the ... [more] | |
[Return to Top Page]