Gregor Leander
Impact in
- Artificial Intelligence top 0.05%
- Cryptographic Implementations and Security
- Coding theory and cryptography
- Cryptography and Data Security
- Security and Verification in Computing
- Hardware and Architecture top 2%
- Physical Unclonable Functions (PUFs) and Hardware Security
Papers in
-
- Cryptographic Implementations and Security 114
- Coding theory and cryptography 35
- Cryptography and Data Security 11
- Privacy-Preserving Technologies in Data 1
- Co-authors
- Axel Y. Poschmann (8 shared papers)Christof Paar (18 shared papers)Lars Ramkilde Knudsen (13 shared papers)Andrey Bogdanov (10 shared papers)Matthew J. B. Robshaw (4 shared papers)Yannick Seurin (3 shared papers)Christof Beierle (22 shared papers)Claude Carlet (9 shared papers)
In The Last Decade
Gregor Leander
149 papers receiving 7.8k citations
Gregor Leander's Hit Papers
Peers
Comparison fields: 5 of 34
- Artificial Intelligence 7.6k
- Hardware and Architecture 266
- Media Technology 205
- Computer Networks and Communications 347
- Discrete Mathematics and Combinatorics 28
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-authors
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
Showing the 20 most-cited of 156 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | PRESENT: An Ultra-Lightweight Block Cipher Hit paper breakdown → | 2007 | 2128 |
| 2 | PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications Hit paper breakdown → | 2012 | 591 |
| 3 | The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS Hit paper breakdown → | 2016 | 534 |
| 4 | 2011 | 275 | |
| 5 | 2007 | 213 | |
| 6 | 2010 | 208 | |
| 7 | 2007 | 163 | |
| 8 | 2008 | 156 | |
| 9 | 2014 | 154 | |
| 10 | PRINCE – A Low-latency Block Cipher for Pervasive Computing Applications | 2012 | 151 |
| 11 | 2015 | 150 | |
| 12 | 2008 | 147 | |
| 13 | 2011 | 129 | |
| 14 | 2017 | 126 | |
| 15 | 2019 | 125 | |
| 16 | 2006 | 116 | |
| 17 | 2005 | 103 | |
| 18 | 2008 | 103 | |
| 19 | 2012 | 99 | |
| 20 | 2008 | 98 |
About Gregor Leander
Gregor Leander is a scholar working on Artificial Intelligence, Discrete Mathematics and Combinatorics, Hardware and Architecture, Media Technology and Geometry and Topology, having authored 156 papers that have together received 8.3k indexed citations. Recurring topics across this work include Cryptographic Implementations and Security (114 papers), Coding theory and cryptography (35 papers), Cryptography and Data Security (11 papers), Privacy-Preserving Technologies in Data (1 paper), Graph theory and applications (1 paper), Advanced Graph Theory Research (1 paper), Security in Wireless Sensor Networks (1 paper) and Physical Unclonable Functions (PUFs) and Hardware Security (1 paper). The work is most often cited by research in Artificial Intelligence (7.6k citations), Hardware and Architecture (266 citations), Media Technology (205 citations), Computer Networks and Communications (347 citations) and Discrete Mathematics and Combinatorics (28 citations). Gregor Leander has collaborated with scholars based in Germany, France and Denmark. Frequent co-authors include Axel Y. Poschmann, Christof Paar, Lars Ramkilde Knudsen, Andrey Bogdanov, Matthew J. B. Robshaw, Yannick Seurin, Christof Beierle, Claude Carlet, Miroslav Knežević and Stefan Kölbl. Their work appears in journals such as IACR Transactions on Symmetric Cryptology, Designs Codes and Cryptography, Lecture notes in computer science, IEEE Transactions on Information Theory and Journal of Cryptology.
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.