Alexander May

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 73

Top Venues

IACR Cryptol. ePrint Arch.

PQCrypto

CRYPTO (2)

EUROCRYPT (3)

University of Paderborn (PHD)

Education History

University of Paderborn

PHD

Publications

Alexander May, Massimo Ostuzzi
Multiple Group Action Dlogs with(out) Precomputation. IACR Cryptol. ePrint Arch. 2024 (2024)
Sebastian Bitzer, Jeroen Delvaux, Elena Kirshanova, Sebastian Maaßen, Alexander May, Antonia Wachter-Zeh
How to Lose Some Weight - A Practical Template Syndrome Decoding Attack. IACR Cryptol. ePrint Arch. 2024 (2024)
Alexander May, Carl Richard Theodor Schneider
Dlog is Practically as Hard (or Easy) as DH - Solving Dlogs via DH Oracles on EC Standards. IACR Cryptol. ePrint Arch. 2023 (2023)
Marcus Brinkmann, Chitchanok Chuengsatiansup, Alexander May, Julian Nowakowski, Yuval Yarom
Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information. IACR Cryptol. ePrint Arch. 2023 (2023)
Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May
Low Memory Attacks on Small Key CSIDH. IACR Cryptol. ePrint Arch. 2023 (2023)
Timo Glaser, Alexander May, Julian Nowakowski
Entropy Suffices for Key Guessing. IACR Cryptol. ePrint Arch. 2023 (2023)
Elena Kirshanova, Alexander May, Julian Nowakowski
New NTRU Records with Improved Lattice Bases. PQCrypto (2023)
Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May
Low Memory Attacks on Small Key CSIDH. ACNS (2023)
Alexander May, Julian Nowakowski
Too Many Hints - When LLL Breaks LWE. IACR Cryptol. ePrint Arch. 2023 (2023)
Alexander May, Julian Nowakowski
Too Many Hints - When LLL Breaks LWE. ASIACRYPT (4) (2023)
Alexander May, Carl Richard Theodor Schneider
Dlog is Practically as Hard (or Easy) as DH - Solving Dlogs via DH Oracles on EC Standards. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023 (4) (2023)
Elena Kirshanova, Alexander May
Breaking Goppa-based McEliece with hints. Inf. Comput. 293 (2023)
Timo Glaser, Alexander May
How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium. CANS (2023)
Elena Kirshanova, Alexander May, Julian Nowakowski
New NTRU Records with Improved Lattice Bases. IACR Cryptol. ePrint Arch. 2023 (2023)
Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. CRYPTO (3) (2022)
Alexander May, Lars Schlieper
Quantum Period Finding is Compression Robust. IACR Trans. Symmetric Cryptol. 2022 (1) (2022)
Alexander May, Julian Nowakowski, Santanu Sarkar
Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents. EUROCRYPT (3) (2022)
Alexander May, Floyd Zweydinger
Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing. CSF (2022)
Julian Speith, Florian Schweins, Maik Ender, Marc Fyrbiak, Alexander May, Christof Paar
How Not to Protect Your IP - An Industry-Wide Break of IEEE 1735 Implementations. IEEE Symposium on Security and Privacy (2022)
Andre Esser, Alexander May, Floyd Zweydinger
McEliece Needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. EUROCRYPT (3) (2022)
Alexander May, Carl Richard Theodor Schneider
How to Backdoor (Classical) McEliece and How to Guard Against Backdoors. IACR Cryptol. ePrint Arch. 2022 (2022)
Elena Kirshanova, Alexander May
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything. SCN (2022)
Alexander May, Julian Nowakowski, Santanu Sarkar
Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents. IACR Cryptol. ePrint Arch. 2022 (2022)
Elena Kirshanova, Alexander May
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything. IACR Cryptol. ePrint Arch. 2022 (2022)
Timo Glaser, Alexander May
How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium. IACR Cryptol. ePrint Arch. 2022 (2022)
Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. IACR Cryptol. ePrint Arch. 2022 (2022)
Tobias Hemmert, Alexander May, Johannes Mittmann, Carl Richard Theodor Schneider
How to Backdoor (Classic) McEliece and How to Guard Against Backdoors. PQCrypto (2022)
Markus Dürmuth, Maximilian Golla, Philipp Markert, Alexander May, Lars Schlieper
Towards Quantum Large-Scale Password Guessing on Real-World Distributions. CANS (2021)
Andre Esser, Alexander May, Floyd Zweydinger
McEliece needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. IACR Cryptol. ePrint Arch. 2021 (2021)
Alexander May, Julian Nowakowski, Santanu Sarkar
Partial Key Exposure Attack on Short Secret Exponent CRT-RSA. IACR Cryptol. ePrint Arch. 2021 (2021)
Alexander May
How to Meet Ternary LWE Keys. IACR Cryptol. ePrint Arch. 2021 (2021)
Alexander May, Lars Schlieper, Jonathan Schwinger
Noisy Simon Period Finding. CT-RSA (2021)
Alexander May, Julian Nowakowski, Santanu Sarkar
Partial Key Exposure Attack on Short Secret Exponent CRT-RSA. ASIACRYPT (1) (2021)
Julian Speith, Florian Schweins, Maik Ender, Marc Fyrbiak, Alexander May, Christof Paar
How Not to Protect Your IP - An Industry-Wide Break of IEEE 1735 Implementations. CoRR (2021)
Iggy van Hoof, Elena Kirshanova, Alexander May
Quantum Key Search for Ternary LWE. IACR Cryptol. ePrint Arch. 2021 (2021)
Markus Dürmuth, Maximilian Golla, Philipp Markert, Alexander May, Lars Schlieper
Towards Quantum Large-Scale Password Guessing on Real-World Distributions. IACR Cryptol. ePrint Arch. 2021 (2021)
Alexander May
How to Meet Ternary LWE Keys. CRYPTO (2) (2021)
Elena Kirshanova, Alexander May
How to Find Ternary LWE Keys Using Locality Sensitive Hashing. IMACC (2021)
Iggy van Hoof, Elena Kirshanova, Alexander May
Quantum Key Search for Ternary LWE. PQCrypto (2021)
Elena Kirshanova, Alexander May
How to Find Ternary LWE Keys Using Locality Sensitive Hashing. IACR Cryptol. ePrint Arch. 2021 (2021)
Alexander May, Floyd Zweydinger
Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing. IACR Cryptol. ePrint Arch. 2021 (2021)
Alexander May
Solving subset sum with small space - Handling cryptanalytic Big Data. it Inf. Technol. 62 (3-4) (2020)
Andre Esser, Alexander May
with Polynomial Memory. EUROCRYPT (3) (2020)
Alexander Helm, Alexander May
The Power of Few Qubits and Collisions - Subset Sum Below Grover's Bound. PQCrypto (2020)
Claire Delaplace, Alexander May
via Representation? J. Math. Cryptol. 14 (1) (2020)
Andre Esser, Alexander May
with Polynomial Memory. IACR Cryptol. ePrint Arch. 2019 (2019)
Claire Delaplace, Andre Esser, Alexander May
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. IACR Cryptol. ePrint Arch. 2019 (2019)
Alexander May, Lars Schlieper, Jonathan Schwinger
Practical Period Finding on IBM Q - Quantum Speedups in the Presence of Errors. CoRR (2019)
Alexander May, Lars Schlieper
Quantum Period Finding with a Single Output Qubit - Factoring n-bit RSA with n/2 Qubits. CoRR (2019)
Claire Delaplace, Alexander May
via Representations? IACR Cryptol. ePrint Arch. 2019 (2019)
Claire Delaplace, Andre Esser, Alexander May
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. IMACC (2019)
Alexander Helm, Laura Kocksch, Alexander May, Estrid Sørensen
Die Entwicklung und Umsetzung von IT-Sicherheitsstandards als sozialer Aushandlungsprozess. Datenschutz und Datensicherheit 43 (11) (2019)
Alexander Helm, Alexander May
. TQC (2018)
Tibor Jager, Saqib A. Kakvi, Alexander May
On the Security of the PKCS#1 v1.5 Signature Scheme. CCS (2018)
Alexander May, Gottfried Herold
LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE. IACR Cryptol. ePrint Arch. 2018 (2018)
Gottfried Herold, Elena Kirshanova, Alexander May
On the asymptotic complexity of solving LWE. Des. Codes Cryptogr. 86 (1) (2018)
Tibor Jager, Saqib A. Kakvi, Alexander May
On the Security of the PKCS#1 v1.5 Signature Scheme. IACR Cryptol. ePrint Arch. 2018 (2018)
Leif Both, Alexander May
Decoding Linear Codes with High Error Rate and Its Impact for LPN Security. PQCrypto (2018)
Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler
Dissection-BKW. IACR Cryptol. ePrint Arch. 2018 (2018)
Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler
Dissection-BKW. CRYPTO (2) (2018)
Gregor Leander, Alexander May
Grover Meets Simon - Quantumly Attacking the FX-construction. IACR Cryptol. ePrint Arch. 2017 (2017)
Gregor Leander, Alexander May
Grover Meets Simon - Quantumly Attacking the FX-construction. ASIACRYPT (2) (2017)
Leif Both, Alexander May
The Approximate k-List Problem. IACR Trans. Symmetric Cryptol. 2017 (1) (2017)
Gottfried Herold, Alexander May
LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE. Public Key Cryptography (1) (2017)
Leif Both, Alexander May
Decoding Linear Codes with High Error Rate and its Impact for LPN Security. IACR Cryptol. ePrint Arch. 2017 (2017)
Andre Esser, Robert Kübler, Alexander May
LPN Decoded. CRYPTO (2) (2017)
Leif Both, Alexander May
The Approximate k-List Problem. IACR Cryptol. ePrint Arch. 2017 (2017)
Andre Esser, Robert Kübler, Alexander May
LPN Decoded. IACR Cryptol. ePrint Arch. 2017 (2017)
Elena Kirshanova, Alexander May, Friedrich Wiemer
Parallel Implementation of BDD Enumeration for LWE. ACNS (2016)
Marc Fischlin, Alexander May, David Pointcheval, Tal Rabin
Public-Key Cryptography (Dagstuhl Seminar 16371). Dagstuhl Reports 6 (9) (2016)
Elena Kirshanova, Alexander May, Friedrich Wiemer
Parallel Implementation of BDD enumeration for LWE. IACR Cryptol. ePrint Arch. 2016 (2016)
Alexander May, Ilya Ozerov
On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes. EUROCRYPT (1) (2015)
Gottfried Herold, Elena Kirshanova, Alexander May
On the Asymptotic Complexity of Solving LWE. IACR Cryptol. ePrint Arch. 2015 (2015)
Alexander May, Ilya Ozerov
A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups. Selected Areas in Cryptography (2014)
Saqib A. Kakvi, Eike Kiltz, Alexander May
Certifying RSA. ASIACRYPT (2012)
Anja Becker, Antoine Joux, Alexander May, Alexander Meurer
: How 1+1=0 Improves Information Set Decoding. IACR Cryptol. ePrint Arch. 2012 (2012)
Anja Becker, Antoine Joux, Alexander May, Alexander Meurer
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. EUROCRYPT (2012)
Marc Fischlin, Anna Lysyanskaya, Ueli Maurer, Alexander May
Public-Key Cryptography (Dagstuhl Seminar 11391). Dagstuhl Reports 1 (9) (2011)
Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren
On CCA-Secure Somewhat Homomorphic Encryption. Selected Areas in Cryptography (2011)
Alexander May, Alexander Meurer, Enrico Thomae
Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$. ASIACRYPT (2011)
Mathias Herrmann, Alexander May
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA. Public Key Cryptography (2010)
Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren
On CCA-Secure Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2010 (2010)
Wilko Henecka, Alexander May, Alexander Meurer
Correcting Errors in RSA Private Keys. CRYPTO (2010)
Alexander May, Maike Ritzenhofen
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint. Public Key Cryptography (2009)
Mathias Herrmann, Alexander May
Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? ASIACRYPT (2009)
Alexander May, Maike Ritzenhofen
Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? Public Key Cryptography (2008)
Mathias Herrmann, Alexander May
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits. ASIACRYPT (2008)
Mathias Herrmann, Alexander May
On Factoring Arbitrary Integers with Known Bits. IACR Cryptol. ePrint Arch. 2007 (2007)
Ellen Jochemsz, Alexander May
. CRYPTO (2007)
Mathias Herrmann, Alexander May
On Factoring Arbitrary Integers with Known Bits. GI Jahrestagung (2) (2007)
Jean-Sébastien Coron, Alexander May
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring. J. Cryptol. 20 (1) (2007)
Ellen Jochemsz, Alexander May
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants. ASIACRYPT (2006)
Daniel Bleichenbacher, Alexander May
New Attacks on RSA with Small Secret CRT-Exponents. Public Key Cryptography (2006)
Johannes Buchmann, Alexander May, Ulrich Vollmer
Perspectives for cryptographic long-term security. Commun. ACM 49 (9) (2006)
Johannes Blömer, Alexander May
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. EUROCRYPT (2005)
Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger
Partial Key Exposure Attacks on RSA up to Full Size Exponents. EUROCRYPT (2005)
Alexander May
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. CRYPTO (2004)
Alexander May
q. Public Key Cryptography (2004)
Jean-Sébastien Coron, Alexander May
Deterministic Polynomial Time Equivalence of Computing the RSA Secret Key and Factoring. IACR Cryptol. ePrint Arch. 2004 (2004)
Johannes Blömer, Alexander May
A Generalized Wiener Attack on RSA. Public Key Cryptography (2004)

Alexander May.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alexander May