Low Secret Exponent RSA Revisited. - Johannes Blömer; Alexander May 001 (CaLC, 2001)

Dimension Reduction Methods for Convolution Modular Lattices. - Alexander May 001; Joseph H. Silverman (CaLC, 2001)

Key Revocation with Interval Cover Families. - Johannes Blömer; Alexander May 001 (Selected Areas in Cryptography, 2001)

Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. - Alexander May 001 (CRYPTO, 2002)

New Partial Key Exposure Attacks on RSA. - Johannes Blömer; Alexander May 001 (CRYPTO, 2003)

New RSA vulnerabilities using lattice reduction methods. - Alexander May 001 (2003)

Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. - Alexander May 001 (CRYPTO, 2004)

A Generalized Wiener Attack on RSA. - Johannes Blömer; Alexander May 001 (Public Key Cryptography, 2004)

Secret Exponent Attacks on RSA-type Schemes with Moduli N= prq. - Alexander May 001 (Public Key Cryptography, 2004)

Deterministic Polynomial Time Equivalence of Computing the RSA Secret Key and Factoring. - Jean-Sébastien Coron; Alexander May 001 (IACR Cryptol. ePrint Arch., 2004)

A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. - Johannes Blömer; Alexander May 001 (EUROCRYPT, 2005)

Partial Key Exposure Attacks on RSA up to Full Size Exponents. - Matthias Ernst; Ellen Jochemsz; Alexander May 001; Benne de Weger (EUROCRYPT, 2005)

A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants. - Ellen Jochemsz; Alexander May 001 (ASIACRYPT, 2006)

New Attacks on RSA with Small Secret CRT-Exponents. - Daniel Bleichenbacher; Alexander May 001 (Public Key Cryptography, 2006)

Perspectives for cryptographic long-term security. - Johannes Buchmann 001; Alexander May 001; Ulrich Vollmer (Commun. ACM, 2006)

A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073. - Ellen Jochemsz; Alexander May 001 (CRYPTO, 2007)

On Factoring Arbitrary Integers with Known Bits. - Mathias Herrmann; Alexander May 001 (GI Jahrestagung (2), 2007)

Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits. - Mathias Herrmann; Alexander May 001 (ASIACRYPT, 2008)

Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? - Alexander May 001; Maike Ritzenhofen (Public Key Cryptography, 2008)

Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? - Mathias Herrmann; Alexander May 001 (ASIACRYPT, 2009)

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint. - Alexander May 001; Maike Ritzenhofen (Public Key Cryptography, 2009)

Correcting Errors in RSA Private Keys. - Wilko Henecka; Alexander May 001; Alexander Meurer (CRYPTO, 2010)

Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA. - Mathias Herrmann; Alexander May 001 (Public Key Cryptography, 2010)

On CCA-Secure Fully Homomorphic Encryption. - Jake Loftus; Alexander May 001; Nigel P. Smart; Frederik Vercauteren (IACR Cryptol. ePrint Arch., 2010)

Using LLL-Reduction for Solving RSA and Factorization Problems. - Alexander May 001 (The LLL Algorithm, 2010)

Decoding Random Linear Codes in $ tilde{ mathcal{O}}(2^{0.054n})$. - Alexander May 001; Alexander Meurer; Enrico Thomae (ASIACRYPT, 2011)

On CCA-Secure Somewhat Homomorphic Encryption. - Jake Loftus; Alexander May 001; Nigel P. Smart; Frederik Vercauteren (Selected Areas in Cryptography, 2011)

Public-Key Cryptography (Dagstuhl Seminar 11391). - Marc Fischlin; Anna Lysyanskaya; Ueli Maurer; Alexander May 001 (Dagstuhl Reports, 2011)

Certifying RSA. - Saqib A. Kakvi; Eike Kiltz; Alexander May 001 (ASIACRYPT, 2012)

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. - Anja Becker 001; Antoine Joux; Alexander May 001; Alexander Meurer (EUROCRYPT, 2012)

Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding. - Anja Becker 001; Antoine Joux; Alexander May 001; Alexander Meurer (IACR Cryptol. ePrint Arch., 2012)

A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups. - Alexander May 001; Ilya Ozerov (Selected Areas in Cryptography, 2014)

On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes. - Alexander May 001; Ilya Ozerov (EUROCRYPT (1), 2015)

On the Asymptotic Complexity of Solving LWE. - Gottfried Herold; Elena Kirshanova; Alexander May 001 (IACR Cryptol. ePrint Arch., 2015)

Parallel Implementation of BDD Enumeration for LWE. - Elena Kirshanova; Alexander May 001; Friedrich Wiemer (ACNS, 2016)

Public-Key Cryptography (Dagstuhl Seminar 16371). - Marc Fischlin; Alexander May 001; David Pointcheval; Tal Rabin (Dagstuhl Reports, 2016)

Grover Meets Simon - Quantumly Attacking the FX-construction. - Gregor Leander; Alexander May 001 (ASIACRYPT (2), 2017)

LPN Decoded. - Andre Esser 001; Robert Kübler; Alexander May 001 (CRYPTO (2), 2017)

LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE. - Gottfried Herold; Alexander May 001 (Public Key Cryptography (1), 2017)

The Approximate k-List Problem. - Leif Both; Alexander May 001 (IACR Cryptol. ePrint Arch., 2017)

On the Security of the PKCS#1 v1.5 Signature Scheme. - Tibor Jager; Saqib A. Kakvi; Alexander May 001 (CCS, 2018)

Dissection-BKW. - Andre Esser 001; Felix Heuer; Robert Kübler; Alexander May 001; Christian Sohler (CRYPTO (2), 2018)

Decoding Linear Codes with High Error Rate and Its Impact for LPN Security. - Leif Both; Alexander May 001 (PQCrypto, 2018)

Subset Sum Quantumly in 1.17n. - Alexander Helm; Alexander May 001 (TQC, 2018)

Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions. - Claire Delaplace; Andre Esser 001; Alexander May 001 (IMACC, 2019)

Quantum Period Finding with a Single Output Qubit - Factoring n-bit RSA with n/2 Qubits. - Alexander May 001; Lars Schlieper (CoRR, 2019)

Practical Period Finding on IBM Q - Quantum Speedups in the Presence of Errors. - Alexander May 001; Lars Schlieper; Jonathan Schwinger (CoRR, 2019)

Die Entwicklung und Umsetzung von IT-Sicherheitsstandards als sozialer Aushandlungsprozess. - Alexander Helm; Laura Kocksch; Alexander May 001; Estrid Sørensen (Datenschutz und Datensicherheit, 2019)

Can we Beat the Square Root Bound for ECDLP over Fp2 via Representations? - Claire Delaplace; Alexander May 001 (IACR Cryptol. ePrint Arch., 2019)

Low Weight Discrete Logarithms and Subset Sum in 20.65n with Polynomial Memory. - Andre Esser 001; Alexander May 001 (IACR Cryptol. ePrint Arch., 2019)

Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory. - Andre Esser 001; Alexander May 001 (EUROCRYPT (3), 2020)

The Power of Few Qubits and Collisions - Subset Sum Below Grover's Bound. - Alexander Helm; Alexander May 001 (PQCrypto, 2020)

Solving subset sum with small space - Handling cryptanalytic Big Data. - Alexander May 001 (it Inf. Technol., 2020)

Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation? - Claire Delaplace; Alexander May 001 (J. Math. Cryptol., 2020)

Partial Key Exposure Attack on Short Secret Exponent CRT-RSA. - Alexander May 001; Julian Nowakowski; Santanu Sarkar 001 (ASIACRYPT (1), 2021)

Towards Quantum Large-Scale Password Guessing on Real-World Distributions. - Markus Dürmuth; Maximilian Golla; Philipp Markert; Alexander May 001; Lars Schlieper (CANS, 2021)

How to Meet Ternary LWE Keys. - Alexander May 001 (CRYPTO (2), 2021)

Noisy Simon Period Finding. - Alexander May 001; Lars Schlieper; Jonathan Schwinger (CT-RSA, 2021)

How to Find Ternary LWE Keys Using Locality Sensitive Hashing. - Elena Kirshanova; Alexander May 001 (IMACC, 2021)

Quantum Key Search for Ternary LWE. - Iggy van Hoof; Elena Kirshanova; Alexander May 001 (PQCrypto, 2021)

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. - Andre Esser 001; Alexander May 001; Javier A. Verbel; Weiqiang Wen (CRYPTO (3), 2022)

Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing. - Alexander May 001; Floyd Zweydinger (CSF, 2022)

McEliece Needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. - Andre Esser 001; Alexander May 001; Floyd Zweydinger (EUROCRYPT (3), 2022)

Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents. - Alexander May 001; Julian Nowakowski; Santanu Sarkar 001 (EUROCRYPT (3), 2022)

How to Backdoor (Classic) McEliece and How to Guard Against Backdoors. - Tobias Hemmert; Alexander May 001; Johannes Mittmann; Carl Richard Theodor Schneider (PQCrypto, 2022)

Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything. - Elena Kirshanova; Alexander May 001 (SCN, 2022)

How Not to Protect Your IP - An Industry-Wide Break of IEEE 1735 Implementations. - Julian Speith; Florian Schweins; Maik Ender; Marc Fyrbiak; Alexander May 001; Christof Paar (SP, 2022)

How to Backdoor (Classical) McEliece and How to Guard Against Backdoors. - Alexander May 001; Carl Richard Theodor Schneider (IACR Cryptol. ePrint Arch., 2022)

Quantum Period Finding is Compression Robust. - Alexander May 001; Lars Schlieper (IACR Trans. Symmetric Cryptol., 2022)

Low Memory Attacks on Small Key CSIDH. - Jesús-Javier Chi-Domínguez; Andre Esser 001; Sabrina Kunzweiler; Alexander May 001 (ACNS, 2023)

Too Many Hints - When LLL Breaks LWE. - Alexander May 001; Julian Nowakowski (ASIACRYPT (4), 2023)

How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium. - Timo Glaser; Alexander May 001 (CANS, 2023)

New NTRU Records with Improved Lattice Bases. - Elena Kirshanova; Alexander May 001; Julian Nowakowski (PQCrypto, 2023)

Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information. - Marcus Brinkmann; Chitchanok Chuengsatiansup; Alexander May 001; Julian Nowakowski; Yuval Yarom (IACR Cryptol. ePrint Arch., 2023)

Entropy Suffices for Key Guessing. - Timo Glaser; Alexander May 001; Julian Nowakowski (IACR Cryptol. ePrint Arch., 2023)

Dlog is Practically as Hard (or Easy) as DH - Solving Dlogs via DH Oracles on EC Standards. - Alexander May 001; Carl Richard Theodor Schneider (IACR Cryptol. ePrint Arch., 2023)

Breaking Goppa-based McEliece with hints. - Elena Kirshanova; Alexander May 001 (Inf. Comput., 2023)

How to Lose Some Weight - A Practical Template Syndrome Decoding Attack. - Sebastian Bitzer; Jeroen Delvaux; Elena Kirshanova; Sebastian Maaßen; Alexander May 001; Antonia Wachter-Zeh (IACR Cryptol. ePrint Arch., 2024)

One Bit to Rule Them All - Imperfect Randomness Harms Lattice Signatures. - Simon Damm; Nicolai Kraus; Alexander May 001; Julian Nowakowski; Jonas Thietke (PKC (1), 2025)

Multiple Group Action Dlogs With(out) Precomputation. - Alexander May 001; Massimo Ostuzzi (PKC (3), 2025)

Solving Concealed ILWE and its Application for Breaking Masked Dilithium. - Simon Damm; Asja Fischer; Alexander May 001; Soundes Marzougui; Leander Schwarz; Henning Seidler; Jean-Pierre Seifert; Jonas Thietke; Vincent Quentin Ulitzsch (IACR Cryptol. ePrint Arch., 2025)

Fast Slicer for Batch-CVP: Making Lattice Hybrid Attacks Practical. - Alexander Karenin; Elena Kirshanova; Alexander May 001; Julian Nowakowski (IACR Cryptol. ePrint Arch., 2025)

Just Guess: Improved (Quantum) Algorithm for the Underdetermined MQ problem. - Alexander May 001; Massimo Ostuzzi; Henrik Ressler (IACR Cryptol. ePrint Arch., 2025)

Super-Quadratic Quantum Speed-ups and Guessing Many Likely Keys. - Timo Glaser; Alexander May 001; Julian Nowakowski (CoRR, 2025)