Demo Data from EDBT 2026 / reviewers in the wild / expert
Kenta Nekado
dblp:30/7196
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1Theory of computation · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 100% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Integrated circuit design · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › finite fields › finite field arithmetic
basis conversion |
0.1 | 1 | 2012 | Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group · IEEE Trans. Inf. Theory 2012 |
Coding theory › finite fields
finite field arithmetic |
0.1 | 1 | 2012 | Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group · IEEE Trans. Inf. Theory 2012 |
Coding theory › finite fields › finite field arithmetic
normal basis |
0.1 | 1 | 2012 | Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group · IEEE Trans. Inf. Theory 2012 |
Cryptographic primitives and cryptanalysis › block cipher
AES |
0.1 | 1 | 2010 | Mixed Bases for Efficient Inversion in \mathbb F((22)2) and Conversion Matrices of SubBytes of AES · CHES 2010 |
Cryptographic primitives and cryptanalysis
block cipher |
0.1 | 1 | 2010 | Mixed Bases for Efficient Inversion in \mathbb F((22)2) and Conversion Matrices of SubBytes of AES · CHES 2010 |
Integrated circuit design
finite field arithmetic |
0.1 | 1 | 2010 | Mixed Bases for Efficient Inversion in \mathbb F((22)2) and Conversion Matrices of SubBytes of AES · CHES 2010 |
Methods — techniques the papers use, named apart from their topics
polynomial basis construction · 0.1cyclic group · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic GroupabstractSeveral methods for finding a basis conversion matrix between two different bases in an extension field have been proposed. Among them, the one based on Gauss period normal basis (GNB) is on average the most efficient. However, since it needs to construct a certain tower field , some inefficient cases in which the towering degree becomes large have been reported. This paper first determines that such inefficient cases are caused by the GNB condition. In order to overcome this inefficiency, we propose a method that does not use any GNB in the target extension field , but instead uses a certain polynomial basis in derived by a certain small cyclic group in . This causes re- laxation of the condition for the towering degree . In addition, our experimental results show that the proposed method substantially accelerates the computation time for finding a basis conversion matrix. Yasuyuki Nogami, Hidehiro Katou, Kenta Nekado, Satoshi Uehara, Yoshitaka Morikawa |
IEEE Trans. Inf. Theory | 3 |
| 2010 | Mixed Bases for Efficient Inversion in \mathbb F((22)2) and Conversion Matrices of SubBytes of AES
Yasuyuki Nogami, Kenta Nekado, Tetsumi Toyota, Naoto Hongo, Yoshitaka Morikawa |
CHES | 2 |