Demo Data from SIGIR 2026 / reviewers in the wild / expert
Kazumaro Aoki
dblp:64/4370
· DBLP profile ↗
29ranked-venue papers
13as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 29 · 13 first-authorTheory of computation · 1 · 1 first-author
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.
| Network and information security
11 papers |
Cryptographic primitives and cryptanalysis · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 100% |
Topics — the 16 heaviest of 19, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
hash function cryptanalysis |
0.4 | 4 | 2009 | Finding Preimages in Full MD5 Faster Than Exhaustive Search · EUROCRYPT 2009 Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 · CRYPTO 2009 Preimages for Step-Reduced SHA-2 · ASIACRYPT 2009 |
Cryptographic primitives and cryptanalysis › hash function cryptanalysis
preimage attack |
0.4 | 4 | 2009 | Finding Preimages in Full MD5 Faster Than Exhaustive Search · EUROCRYPT 2009 Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 · CRYPTO 2009 Preimages for Step-Reduced SHA-2 · ASIACRYPT 2009 |
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis
fast correlation attack |
0.3 | 1 | 2018 | Fast Correlation Attack Revisited - Cryptanalysis on Full Grain-128a, Grain-128, and Grain-v1 · CRYPTO (2) 2018 |
Cryptographic primitives and cryptanalysis
stream cipher cryptanalysis |
0.3 | 1 | 2018 | Fast Correlation Attack Revisited - Cryptanalysis on Full Grain-128a, Grain-128, and Grain-v1 · CRYPTO (2) 2018 |
Cryptographic primitives and cryptanalysis
integer factorization |
0.3 | 4 | 2010 | Factorization of a 768-Bit RSA Modulus · CRYPTO 2010 A Kilobit Special Number Field Sieve Factorization · ASIACRYPT 2007 Integer Factoring Utilizing PC Cluster · CHES 2006 |
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA |
0.1 | 2 | 2010 | Factorization of a 768-Bit RSA Modulus · CRYPTO 2010 A Kilobit Special Number Field Sieve Factorization · ASIACRYPT 2007 |
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key cryptanalysis |
0.1 | 1 | 2010 | Factorization of a 768-Bit RSA Modulus · CRYPTO 2010 |
Cryptographic primitives and cryptanalysis › hash functions › dedicated hash functions
MD5 |
0.1 | 1 | 2009 | Finding Preimages in Full MD5 Faster Than Exhaustive Search · EUROCRYPT 2009 |
Cryptographic primitives and cryptanalysis › generic attacks
meet-in-the-middle attack |
0.1 | 1 | 2009 | Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 · CRYPTO 2009 |
Cryptographic primitives and cryptanalysis › hash function cryptanalysis
SHA-2 |
0.1 | 1 | 2009 | Preimages for Step-Reduced SHA-2 · ASIACRYPT 2009 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.1 | 2 | 2007 | Integer Factoring Utilizing PC Cluster · CHES 2006 A Kilobit Special Number Field Sieve Factorization · ASIACRYPT 2007 |
Cryptographic primitives and cryptanalysis
linear cryptanalysis |
0.0 | 2 | 1995 | Improving the Search Algorithm for the Best Linear Expression · CRYPTO 1995 Linear Cryptanalysis of the Fast Data Encipherment Algorithm · CRYPTO 1994 |
High-performance computing
cluster computing |
0.0 | 1 | 2006 | Integer Factoring Utilizing PC Cluster · CHES 2006 |
High-performance computing › cluster computing
PC cluster |
0.0 | 1 | 2006 | Integer Factoring Utilizing PC Cluster · CHES 2006 |
Algorithms and data structures › sequence algorithms › sorting › distribution sort
bucket sort |
0.0 | 1 | 2004 | Sieving Using Bucket Sort · ASIACRYPT 2004 |
Algorithms and data structures › sequence algorithms
sorting |
0.0 | 1 | 2004 | Sieving Using Bucket Sort · ASIACRYPT 2004 |
Methods — techniques the papers use, named apart from their topics
number field sieve · 0.2parallel factoring · 0.1meet-in-the-middle attack · 0.1exhaustive search · 0.1search algorithm · 0.0linear cryptanalysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | On the Data Limitation of Small-State Stream Ciphers: Correlation Attacks on Fruit-80 and Plantlet
Yosuke Todo, Willi Meier, Kazumaro Aoki |
SAC | 3 |
| 2018 | Fast Correlation Attack Revisited - Cryptanalysis on Full Grain-128a, Grain-128, and Grain-v1
Yosuke Todo, Takanori Isobe 0001, Willi Meier, Kazumaro Aoki, Bin Zhang 0003 |
CRYPTO (2) | 4 |
| 2016 | Wide Trail Design Strategy for Binary MixColumns - Enhancing Lower Bound of Number of Active S-boxes
Yosuke Todo, Kazumaro Aoki |
ACNS | 2 |
| 2014 | Differential and Impossible Differential Related-Key Attacks on Hierocrypt-L1
Bungo Taga, Shiho Moriai, Kazumaro Aoki |
ACISP | 3 |
| 2014 | FFT Key Recovery for Integral Attack
Yosuke Todo, Kazumaro Aoki |
CANS | 2 |
| 2013 | Highly Accurate Key Extraction Method for Access-Driven Cache Attacks Using Correlation Coefficient
Junko Takahashi, Toshinori Fukunaga, Kazumaro Aoki, Hitoshi Fuji |
ACISP | 3 |
| 2013 | The Security of the OCB Mode of Operation without the SPRP Assumption
Kazumaro Aoki, Kan Yasuda |
ProvSec | 1 |
| 2012 | The Security and Performance of "GCM" when Short Multiplications Are Used Instead
Kazumaro Aoki, Kan Yasuda |
Inscrypt | 1 |
| 2012 | A middletext distinguisher for full CLEFIA-128
Kazumaro Aoki |
ISITA | 1 |
| 2011 | Byte Slicing Grøstl - Optimized Intel AES-NI and 8-bit Implementations of the SHA-3 Finalist Grøstl
Kazumaro Aoki, Günther Roland, Yu Sasaki 0001, Martin Schläffer |
SECRYPT | 1 |
| 2010 | Factorization of a 768-Bit RSA Modulus
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann 0001 |
CRYPTO | 2 |
| 2009 | Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others
Yu Sasaki 0001, Kazumaro Aoki |
ACISP | 2 |
| 2009 | Preimages for Step-Reduced SHA-2
Kazumaro Aoki, Jian Guo 0001, Krystian Matusiewicz, Yu Sasaki 0001, Lei Wang 0031 |
ASIACRYPT | 1 |
| 2009 | Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Kazumaro Aoki, Yu Sasaki 0001 |
CRYPTO | 1 |
| 2009 | Finding Preimages in Full MD5 Faster Than Exhaustive Search
Yu Sasaki 0001, Kazumaro Aoki |
EUROCRYPT | 2 |
| 2008 | Preimage Attacks on Step-Reduced MD5
Yu Sasaki 0001, Kazumaro Aoki |
ACISP | 2 |
| 2008 | Preimage Attacks on 3, 4, and 5-Pass HAVAL
Yu Sasaki 0001, Kazumaro Aoki |
ASIACRYPT | 2 |
| 2008 | Faster Implementation of eta-T Pairing over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition
Yuto Kawahara, Kazumaro Aoki, Tsuyoshi Takagi |
Pairing | 2 |
| 2007 | A Kilobit Special Number Field Sieve Factorization
Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik |
ASIACRYPT | 1 |
| 2006 | Integer Factoring Utilizing PC Cluster
Kazumaro Aoki |
CHES | 1 |
| 2006 | Forward-Secure Authenticated-Encryption in Multi-Receiver Setting
Kan Yasuda, Kazumaro Aoki, Eiichiro Fujisaki, Atsushi Fujioka |
SECRYPT | 2 |
| 2004 | Sieving Using Bucket Sort
Kazumaro Aoki, Hiroki Ueda |
ASIACRYPT | 1 |
| 2001 | A Cyclic Window Algorithm for ECC Defined over Extension Fields
Kazumaro Aoki, Fumitaka Hoshino, Tetsutaro Kobayashi |
ICICS | 1 |
| 2001 | Elliptic Curve Arithmetic Using SIMD
Kazumaro Aoki, Fumitaka Hoshino, Tetsutaro Kobayashi, Hiroaki Oguro |
ISC | 1 |
| 1998 | On Maximum Non-averaged Differential Probability
Kazumaro Aoki |
Selected Areas in Cryptography | 1 |
| 1998 | A Strategy for Constructing Fast Round Functions with Practical Security Against Differential and Linear Cryptanalysis
Masayuki Kanda, Youichi Takashima, Tsutomu Matsumoto, Kazumaro Aoki, Kazuo Ohta |
Selected Areas in Cryptography | 4 |
| 1997 | Best Differential Characteristic Search of FEAL
Kazumaro Aoki, Kunio Kobayashi, Shiho Moriai |
FSE | 1 |
| 1995 | Improving the Search Algorithm for the Best Linear Expression
Kazuo Ohta, Shiho Moriai, Kazumaro Aoki |
CRYPTO | 3 |
| 1994 | Linear Cryptanalysis of the Fast Data Encipherment Algorithm
Kazuo Ohta, Kazumaro Aoki |
CRYPTO | 2 |