| 2026 | CRYPTO | Halfspace Learning for Lattice Signature Key Recovery from Signs. | Marcus Brinkmann, Nicolai Kraus, Alexander May |
| 2026 | EuroCrypt | Super-Quadratic Quantum Speed-ups and Guessing Many Likely Keys. | Kaveh Bashiri, Timo Glaser, Alexander May, Julian Nowakowski |
| 2026 | EuroCrypt | Just Guess: Improved (Quantum) Algorithm for the Underdetermined MQ Problem. | Alexander May, Massimo Ostuzzi, Henrik Ressler |
| 2025 | ASIACRYPT | Solving Concealed ILWE and Its Application for Breaking Masked Dilithium. | Simon Damm, Asja Fischer, Alexander May, Soundes Marzougui, Leander Schwarz, Henning Seidler, Jean-Pierre Seifert, Jonas Thietke, Vincent Quentin Ulitzsch |
| 2025 | ASIACRYPT | Fast Slicer for Batch-CVP: Making Lattice Hybrid Attacks Practical. | Alexander Karenin, Elena Kirshanova, Julian Nowakowski, Alexander May |
| 2025 | IVA | Affective interactions with AI controlled conversational agents in Virtual Reality. | Leon O. H. Kroczek, Mathis Hasler, Alexander May, Andreas Ruider, Andreas Mhlberger |
| 2025 | PKC | One Bit to Rule Them All - Imperfect Randomness Harms Lattice Signatures. | Simon Damm, Nicolai Kraus, Alexander May, Julian Nowakowski, Jonas Thietke |
| 2025 | PKC | Multiple Group Action Dlogs With(out) Precomputation. | Alexander May, Massimo Ostuzzi |
| 2023 | ACNS | Low Memory Attacks on Small Key CSIDH. | Jess-Javier Chi-Domnguez, Andre Esser, Sabrina Kunzweiler, Alexander May |
| 2023 | ASIACRYPT | Too Many Hints - When LLL Breaks LWE. | Alexander May, Julian Nowakowski |
| 2023 | CANS | How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium. | Timo Glaser, Alexander May |
| 2023 | PQCrypto | New NTRU Records with Improved Lattice Bases. | Elena Kirshanova, Alexander May, Julian Nowakowski |
| 2022 | CRYPTO | Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. | Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen |
| 2022 | EuroCrypt | McEliece Needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. | Andre Esser, Alexander May, Floyd Zweydinger |
| 2022 | EuroCrypt | Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents. | Alexander May, Julian Nowakowski, Santanu Sarkar |
| 2022 | PQCrypto | How to Backdoor (Classic) McEliece and How to Guard Against Backdoors. | Tobias Hemmert, Alexander May, Johannes Mittmann, Carl Richard Theodor Schneider |
| 2022 | SP | How Not to Protect Your IP - An Industry-Wide Break of IEEE 1735 Implementations. | Julian Speith, Florian Schweins, Maik Ender, Marc Fyrbiak, Alexander May, Christof Paar |
| 2022 | SCN | Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything. | Elena Kirshanova, Alexander May |
| 2021 | ASIACRYPT | Partial Key Exposure Attack on Short Secret Exponent CRT-RSA. | Alexander May, Julian Nowakowski, Santanu Sarkar |
| 2021 | CANS | Towards Quantum Large-Scale Password Guessing on Real-World Distributions. | Markus Drmuth, Maximilian Golla, Philipp Markert, Alexander May, Lars Schlieper |
| 2021 | CRYPTO | How to Meet Ternary LWE Keys. | Alexander May |
| 2021 | PQCrypto | Quantum Key Search for Ternary LWE. | Iggy van Hoof, Elena Kirshanova, Alexander May |
| 2020 | EuroCrypt | Low Weight Discrete Logarithm and Subset Sum in 2 | Andre Esser, Alexander May |
| 2020 | PQCrypto | The Power of Few Qubits and Collisions - Subset Sum Below Grover's Bound. | Alexander Helm, Alexander May |
| 2018 | CCS | On the Security of the PKCS#1 v1.5 Signature Scheme. | Tibor Jager, Saqib A. Kakvi, Alexander May |
| 2018 | CRYPTO | Dissection-BKW. | Andre Esser, Felix Heuer, Robert Kbler, Alexander May, Christian Sohler |
| 2018 | PQCrypto | Decoding Linear Codes with High Error Rate and Its Impact for LPN Security. | Leif Both, Alexander May |
| 2017 | ASIACRYPT | Grover Meets Simon - Quantumly Attacking the FX-construction. | Gregor Leander, Alexander May |
| 2017 | CRYPTO | LPN Decoded. | Andre Esser, Robert Kbler, Alexander May |
| 2017 | PKC | LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE. | Gottfried Herold, Alexander May |
| 2016 | ACNS | Parallel Implementation of BDD Enumeration for LWE. | Elena Kirshanova, Alexander May, Friedrich Wiemer |
| 2015 | EuroCrypt | On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes. | Alexander May, Ilya Ozerov |
| 2012 | ASIACRYPT | Certifying RSA. | Saqib A. Kakvi, Eike Kiltz, Alexander May |
| 2012 | EuroCrypt | Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. | Anja Becker, Antoine Joux, Alexander May, Alexander Meurer |
| 2011 | ASIACRYPT | Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$. | Alexander May, Alexander Meurer, Enrico Thomae |
| 2011 | HRI | ShakeTime!: a deceptive robot referee. | Marynel Vzquez, Alexander May, Aaron Steinfeld, Wei-Hsuan Chen |
| 2010 | AAAI | ShakeTime! A Persuasive Robotic Game. | Marynel Vzquez, Alexander May, Wei-Hsuan Chen |
| 2010 | CRYPTO | Correcting Errors in RSA Private Keys. | Wilko Henecka, Alexander May, Alexander Meurer |
| 2010 | PKC | Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA. | Mathias Herrmann, Alexander May |
| 2009 | ASIACRYPT | Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? | Mathias Herrmann, Alexander May |
| 2009 | PKC | Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint. | Alexander May, Maike Ritzenhofen |
| 2008 | ASIACRYPT | Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits. | Mathias Herrmann, Alexander May |
| 2008 | PKC | Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? | Alexander May, Maike Ritzenhofen |
| 2007 | CRYPTO | A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than | Ellen Jochemsz, Alexander May |
| 2007 | GI | On Factoring Arbitrary Integers with Known Bits. | Mathias Herrmann, Alexander May |
| 2006 | ASIACRYPT | A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants. | Ellen Jochemsz, Alexander May |
| 2006 | PKC | New Attacks on RSA with Small Secret CRT-Exponents. | Daniel Bleichenbacher, Alexander May |
| 2005 | EuroCrypt | A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. | Johannes Blmer, Alexander May |
| 2005 | EuroCrypt | Partial Key Exposure Attacks on RSA up to Full Size Exponents. | Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger |
| 2004 | CRYPTO | Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. | Alexander May |
| 2004 | PKC | A Generalized Wiener Attack on RSA. | Johannes Blmer, Alexander May |
| 2004 | PKC | Secret Exponent Attacks on RSA-type Schemes with Moduli N= p | Alexander May |
| 2003 | CRYPTO | New Partial Key Exposure Attacks on RSA. | Johannes Blmer, Alexander May |
| 2002 | CRYPTO | Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. | Alexander May |