Gregor Leander
- Artificial Intelligence top 1%
- Coding theory and cryptography 61
- Cryptographic Implementations and Security 51
- Hardware and Architecture top 5%
- Physical Unclonable Functions (PUFs) and Hardware Security 9
-
- Chaos-based Image/Signal Encryption 25
-
- graph theory and CDMA systems 23
-
- Cancer Mechanisms and Therapy 7
-
- semigroups and automata theory 3
-
- DNA and Biological Computing 3
Gregor Leander
75 papers receiving 1.4k citations
Peers
Comparison fields: 5 of 40
- Artificial Intelligence 1.4k
- Discrete Mathematics and Combinatorics 93
- Hardware and Architecture 175
- Computer Vision and Pattern Recognition 400
- Electrical and Electronic Engineering 637
Countries citing papers authored by Gregor Leander
This map shows the geographic impact of Gregor Leander'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 Gregor Leander with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gregor Leander more than expected).
Fields of papers citing papers by Gregor Leander
This network shows the impact of papers produced by Gregor Leander. 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 Gregor Leander. The network helps show where Gregor Leander may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Gregor Leander, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 1 | |
| 2 | 2025 | 0 | |
| 3 | 2023 | 1 | |
| 4 | 2023 | 2 | |
| 5 | 2022 | 1 | |
| 6 | 2020 | 23 | |
| 7 | 2018 | 12 | |
| 8 | 2016 | 31 | |
| 9 | Integral and Multidimensional Linear Distinguishers with Correlation Zero | 2012 | 6 |
| 10 | Key-Alternating Ciphers in a Provable Setting: Encryption Using A Small Number of Public Permutations | 2012 | 5 |
| 11 | Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations (Extended Abstract) | 2012 | 3 |
| 12 | 2011 | 3 | |
| 13 | 2010 | 73 | |
| 14 | 2009 | 36 | |
| 15 | 2008 | 17 | |
| 16 | 2008 | 84 | |
| 17 | PRESENT: An Ultra-Lightweight Block Cipher | 2007 | 1 |
| 18 | 2005 | 80 | |
| 19 | 2005 | 43 | |
| 20 | A Collision-Attack on AES Combining Side Channel- and Differential-Attack | 2004 | 4 |
About Gregor Leander
Gregor Leander is a scholar working on Artificial Intelligence, Hardware and Architecture, Computer Vision and Pattern Recognition, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 78 papers that have together received 1.5k indexed citations. Recurring topics across this work include Coding theory and cryptography (61 papers), Cryptographic Implementations and Security (51 papers), Chaos-based Image/Signal Encryption (25 papers), graph theory and CDMA systems (23 papers), Physical Unclonable Functions (PUFs) and Hardware Security (9 papers), Cancer Mechanisms and Therapy (7 papers), semigroups and automata theory (3 papers) and DNA and Biological Computing (3 papers). The work is most often cited by research in Artificial Intelligence (1.4k citations), Discrete Mathematics and Combinatorics (93 citations), Hardware and Architecture (175 citations), Computer Vision and Pattern Recognition (400 citations) and Electrical and Electronic Engineering (637 citations). Gregor Leander has collaborated with scholars based in Germany, France and Denmark. Frequent co-authors include Claude Carlet, Lilya Budaghyan, Christof Beierle, Hans Dobbertin, Carl Bracken, Amir Moradi, Anne Canteaut, Shahram Rasoolzadeh, Christof Paar and Patrick Felke. Their work appears in journals such as IACR Transactions on Symmetric Cryptology, Designs Codes and Cryptography, IEEE Transactions on Information Theory, Journal of Cryptology and Finite Fields and Their Applications.
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.