Alexander May

From MaRDI portal
(Redirected from Person:826242)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Too many hints -- when LLL breaks LWE2024-09-13Paper
How to enumerate LWE keys as narrow as in \textsc{Kyber}/\textsc{Dilithium}2024-06-05Paper
New NTRU Records with Improved Lattice Bases2024-04-26Paper
Low memory attacks on small key CSIDH2023-11-10Paper
Decoding McEliece with a hint -- secret Goppa key parts reveal everything
Lecture Notes in Computer Science
2023-07-25Paper
Breaking Goppa-based McEliece with hints
Information and Computation
2023-07-17Paper
How to backdoor (classic) McEliece and how to guard against backdoors
Post-Quantum Cryptography
2023-07-07Paper
Partial key exposure attacks on BIKE, Rainbow and NTRU
Advances in Cryptology – CRYPTO 2022
2023-06-30Paper
Partial key exposure attack on short secret exponent CRT-RSA
Lecture Notes in Computer Science
2023-05-12Paper
Subset Sum Quantumly in 1.17 n .2023-04-26Paper
The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
Post-Quantum Cryptography
2022-10-13Paper
Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents2022-08-30Paper
McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD2022-08-30Paper
How to find ternary LWE keys using locality sensitive hashing2022-06-29Paper
Towards quantum large-scale password guessing on real-world distributions2022-06-29Paper
How to meet ternary LWE keys2022-04-22Paper
Quantum key search for ternary LWE2022-03-22Paper
Lattice-based integer factorisation: an introduction to Coppersmith's method2022-02-25Paper
Noisy Simon period finding
(available as arXiv preprint)
2021-12-20Paper
Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory2021-12-01Paper
Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
Journal of Mathematical Cryptology
2021-05-03Paper
Improved low-memory subset sum and LPN algorithms via multiple collisions2020-05-06Paper
Dissection-BKW2018-09-26Paper
Decoding linear codes with high error rate and its impact for LPN security2018-06-22Paper
Grover meets Simon -- quantumly attacking the FX-construction2018-03-08Paper
On the asymptotic complexity of solving LWE
Designs, Codes and Cryptography
2018-01-26Paper
LPN decoded2017-11-15Paper
LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
Lecture Notes in Computer Science
2017-06-13Paper
Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
Applied Cryptography and Network Security
2016-10-04Paper
A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
Selected Areas in Cryptography -- SAC 2014
2016-04-13Paper
On computing nearest neighbors with applications to decoding of binary linear codes
Advances in Cryptology -- EUROCRYPT 2015
2015-09-30Paper
Certifying RSA
Advances in Cryptology – ASIACRYPT 2012
2013-03-19Paper
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Advances in Cryptology – EUROCRYPT 2012
2012-06-29Paper
On CCA-Secure Somewhat Homomorphic Encryption
Selected Areas in Cryptography
2012-06-08Paper
Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
Lecture Notes in Computer Science
2011-12-02Paper
Correcting errors in RSA private keys
Advances in Cryptology – CRYPTO 2010
2010-08-24Paper
Maximizing small root bounds by linearization and applications to small secret exponent RSA
Public Key Cryptography – PKC 2010
2010-05-28Paper
Using LLL-reduction for solving RSA and factorization problems
The LLL Algorithm
2010-03-05Paper
Attacking power generators using unravelled linearization: when do we output too much?
Advances in Cryptology – ASIACRYPT 2009
2009-12-15Paper
Public Key Cryptography – PKC 2004
Lecture Notes in Computer Science
2009-05-14Paper
Public Key Cryptography – PKC 2004
Lecture Notes in Computer Science
2009-05-14Paper
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
Public Key Cryptography – PKC 2009
2009-03-24Paper
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
Advances in Cryptology - CRYPTO 2007
2009-03-10Paper
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
Advances in Cryptology - ASIACRYPT 2008
2009-02-10Paper
Partial Key Exposure Attacks on RSA up to Full Size Exponents
Lecture Notes in Computer Science
2008-05-06Paper
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
Lecture Notes in Computer Science
2008-05-06Paper
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
Advances in Cryptology – ASIACRYPT 2006
2008-04-24Paper
Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
Public key cryptography -- PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9--12, 2008. Proceedings
2008-03-05Paper
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science
2007-11-28Paper
Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
Journal of Cryptology
2007-05-24Paper
Public Key Cryptography - PKC 2006
Lecture Notes in Computer Science
2007-05-02Paper
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science
2005-08-23Paper
scientific article; zbMATH DE number 2085216 (Why is no real title available?)2004-08-09Paper
scientific article; zbMATH DE number 1942424 (Why is no real title available?)2003-06-30Paper
scientific article; zbMATH DE number 1852140 (Why is no real title available?)2003-01-09Paper
scientific article; zbMATH DE number 1852133 (Why is no real title available?)2003-01-09Paper


Research outcomes over time


This page was built for person: Alexander May