Citations per year, relative to Kazumaro Aoki Kazumaro Aoki (= 1×)
peers
Jiqiang Lu
Countries citing papers authored by Kazumaro Aoki
Since
Specialization
Citations
This map shows the geographic impact of Kazumaro Aoki's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kazumaro Aoki with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kazumaro Aoki more than expected).
This network shows the impact of papers produced by Kazumaro Aoki. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kazumaro Aoki. The network helps show where Kazumaro Aoki may publish in the future.
Co-authorship network of co-authors of Kazumaro Aoki
This figure shows the co-authorship network connecting the top 25 collaborators of Kazumaro Aoki.
A scholar is included among the top collaborators of Kazumaro Aoki based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Kazumaro Aoki. Kazumaro Aoki is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Todo, Yosuke & Kazumaro Aoki. (2016). Wide trail design strategy for binary mixcolumns: Enhancing lower bound of number of active s-boxes. Lecture notes in computer science. 9696. 467–484.1 indexed citations
Aoki, Kazumaro. (2012). A middletext distinguisher for full CLEFIA-128. International Symposium on Information Theory and its Applications. 521–525.2 indexed citations
Aoki, Kazumaro, Tetsuya Ichikawa, Masayuki Kanda, et al.. (2002). The 128-Bit Block Cipher Camellia. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(1). 11–24.1 indexed citations
11.
Aoki, Kazumaro, Tetsuya Ichikawa, Masayuki Kanda, et al.. (2001). Speci cation of Camellia | a 128-bit Block Cipher.3 indexed citations
12.
Aoki, Kazumaro. (2000). Practical Evaluation of Security against Generalized Interpolation Attack. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(1). 33–38.4 indexed citations
13.
Aoki, Kazumaro & Hiroki R. Ueda. (2000). Optimized Software Implementations of E 2. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(1). 101–105.2 indexed citations
14.
Kanda, Masayuki, Shiho Moriai, Kazumaro Aoki, et al.. (2000). E2 - A new 128-bit block cipher. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(1). 48–59.9 indexed citations
15.
Aoki, Kazumaro, Tetsuya Ichikawa, Masayuki Kanda, et al.. (2000). Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms.20 indexed citations
16.
Aoki, Kazumaro & Helger Lipmaa. (2000). Fast Implementations of AES Candidates.. 106–120.36 indexed citations
17.
Moriai, Shiho, et al.. (1997). Key-Dependency of Linear Probability of RC5. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 80(1). 9–18.1 indexed citations
18.
Aoki, Kazumaro, et al.. (1997). Strict Evaluation of the Maximum Average of Differential Probability and the Maximum Average of Linear Probability. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 2–8.15 indexed citations
19.
Moriai, Shiho, Kazumaro Aoki, & Kazuo Ohta. (1996). The best linear expression search of FEAL. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 79(1). 2–11.1 indexed citations
20.
Aoki, Kazumaro, et al.. (1995). Differential-Linear Cryptanalysis of FEAL-8. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 1995(1). 20–27.2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.