Jun Kogure

410 total citations
10 papers, 113 citations indexed

About

Jun Kogure is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Jun Kogure has authored 10 papers receiving a total of 113 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 3 papers in Information Systems. Recurrent topics in Jun Kogure's work include Cryptography and Data Security (9 papers), Cryptographic Implementations and Security (6 papers) and Complexity and Algorithms in Graphs (5 papers). Jun Kogure is often cited by papers focused on Cryptography and Data Security (9 papers), Cryptographic Implementations and Security (6 papers) and Complexity and Algorithms in Graphs (5 papers). Jun Kogure collaborates with scholars based in Japan and United Kingdom. Jun Kogure's co-authors include Takeshi Shimoyama, Masaya Yasuda, Takeshi Koshiba, Kazuhiro Yokoyama, Tetsuya Izu, Noboru Kunihiro and H. Yamamoto and has published in prestigious journals such as Designs Codes and Cryptography, Security and Communication Networks and IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences.

In The Last Decade

Jun Kogure

10 papers receiving 112 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jun Kogure Japan	4	91	38	34	22	17	10	113
Mohammad Mahmoody United States	7	98 1.1×	22 0.6×	21 0.6×	22 1.0×	11 0.6×	22	131
Guilhem Castagnos France	4	109 1.2×	21 0.6×	46 1.4×	35 1.6×	10 0.6×	8	118
Stanislav Bulygin Germany	8	104 1.1×	36 0.9×	19 0.6×	41 1.9×	11 0.6×	18	140
Khoa Nguyen Singapore	7	91 1.0×	21 0.6×	41 1.2×	22 1.0×	10 0.6×	22	113
Mads J. Jurik Denmark	4	148 1.6×	37 1.0×	43 1.3×	32 1.5×	6 0.4×	6	167
Shigeo Mitsunari Japan	4	137 1.5×	48 1.3×	90 2.6×	19 0.9×	7 0.4×	6	161
Keita Xagawa Japan	7	141 1.5×	33 0.9×	41 1.2×	33 1.5×	9 0.5×	19	154
Alex J. Malozemoff United States	8	73 0.8×	14 0.4×	19 0.6×	10 0.5×	9 0.5×	11	88
Mehdi Tibouchi Japan	8	168 1.8×	27 0.7×	74 2.2×	43 2.0×	13 0.8×	37	191
Takashi Nishide Japan	7	84 0.9×	17 0.4×	53 1.6×	18 0.8×	8 0.5×	42	120

Countries citing papers authored by Jun Kogure

Since Specialization

Citations

This map shows the geographic impact of Jun Kogure'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 Jun Kogure with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jun Kogure more than expected).

Fields of papers citing papers by Jun Kogure

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jun Kogure. 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 Jun Kogure. The network helps show where Jun Kogure may publish in the future.

Co-authorship network of co-authors of Jun Kogure

This figure shows the co-authorship network connecting the top 25 collaborators of Jun Kogure. A scholar is included among the top collaborators of Jun Kogure 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 Jun Kogure. Jun Kogure is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

10 of 10 papers shown

Yasuda, Masaya, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, & Takeshi Koshiba. (2017). Analysis of decreasing squared-sum of Gram–Schmidt lengths for short lattice vectors. Journal of Mathematical Cryptology. 11(1). 1–24. 3 indexed citations

Yasuda, Masaya, Takeshi Shimoyama, Jun Kogure, & Tetsuya Izu. (2016). Computational hardness of IFP and ECDLP. Applicable Algebra in Engineering Communication and Computing. 27(6). 493–521. 11 indexed citations

Yasuda, Masaya, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, & Takeshi Koshiba. (2015). New packing method in somewhat homomorphic encryption and its applications. Security and Communication Networks. 8(13). 2194–2213. 26 indexed citations

Yasuda, Masaya, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, & Takeshi Koshiba. (2014). On the exact decryption range for Gentry–Halevi's implementation of fully homomorphic encryption. Journal of Mathematical Cryptology. 8(3). 305–329. 1 indexed citations

Yasuda, Masaya, Takeshi Shimoyama, & Jun Kogure. (2014). Secret computation of purchase history data using somewhat homomorphic encryption. 6(1). 1 indexed citations

Yasuda, Masaya, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, & Takeshi Koshiba. (2013). Secure pattern matching using somewhat homomorphic encryption. 65–76. 61 indexed citations

Kogure, Jun, Noboru Kunihiro, & H. Yamamoto. (2012). On the Hardness of Subset Sum Problem from Different Intervals. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. E95.A(5). 903–908. 1 indexed citations

Yasuda, Masaya, Tetsuya Izu, Takeshi Shimoyama, & Jun Kogure. (2011). On random walks of Pollard's rho method for the ECDLP on Koblitz curves. Kyushu University Institutional Repository (QIR) (Kyushu University). 3. 107–112. 1 indexed citations

Shimoyama, Takeshi, Tetsuya Izu, & Jun Kogure. (2007). CAIRN3: An FPGA Implementation of the Sieving Step with the Lattice Sieving. IEICE Technical Report; IEICE Tech. Rep.. 107(209). 77–83. 1 indexed citations

10.

Izu, Tetsuya, Jun Kogure, Takeshi Koshiba, & Takeshi Shimoyama. (2007). Low-density attack revisited. Designs Codes and Cryptography. 43(1). 47–59. 7 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.

Explore authors with similar magnitude of impact