Alexander May
Orcid: 0000000159655675Affiliations:
 Ruhr University Bochum, Horst Görtz Institute, Germany
 TU Darmstadt, Department of Computer Science, Germany (former)
 University of Paderborn, Department of computer Science, Germany (former)
According to our database^{1},
Alexander May
authored at least 79 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org

on dnb.info

on cits.rub.de
On csauthors.net:
Bibliography
2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
2023
Inf. Comput., August, 2023
Dlog is Practically as Hard (or Easy) as DH  Solving Dlogs via DH Oracles on EC Standards.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Leaky McEliece: Secret Key Recovery From Highly Erroneous SideChannel Information.
IACR Cryptol. ePrint Arch., 2023
2022
IACR Trans. Symmetric Cryptol., 2022
IACR Cryptol. ePrint Arch., 2022
Approximate Divisor Multiples  Factoring with Only a Third of the Secret CRTExponents.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022
Proceedings of the PostQuantum Cryptography  13th International Workshop, 2022
2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
McEliece needs a Break  Solving McEliece1284 and QuasiCyclic2918 with Modern ISD.
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Proceedings of the Topics in Cryptology  CTRSA 2021, 2021
2020
Can we Beat the Square Root Bound for ECDLP over 𝔽<sub>p<sup>2</sup></sub> via Representation?
J. Math. Cryptol., 2020
it Inf. Technol., 2020
Proceedings of the PostQuantum Cryptography  11th International Conference, 2020
Low Weight Discrete Logarithm and Subset Sum in 2<sup>0.65n</sup> with Polynomial Memory.
Proceedings of the Advances in Cryptology  EUROCRYPT 2020, 2020
2019
Low Weight Discrete Logarithms and Subset Sum in 2<sup>0.65n</sup> with Polynomial Memory.
IACR Cryptol. ePrint Arch., 2019
Can we Beat the Square Root Bound for ECDLP over F<sub>p<sup>2</sup></sub> via Representations?
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Die Entwicklung und Umsetzung von ITSicherheitsstandards als sozialer Aushandlungsprozess.
Datenschutz und Datensicherheit, 2019
CoRR, 2019
Quantum Period Finding with a Single Output Qubit  Factoring nbit RSA with n/2 Qubits.
CoRR, 2019
2018
LP Solutions of Vectorial Integer Subset Sums  Cryptanalysis of Galbraith's Binary Matrix LWE.
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Des. Codes Cryptogr., 2018
Proceedings of the 13th Conference on the Theory of Quantum Computation, 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
2016
IACR Cryptol. ePrint Arch., 2016
Dagstuhl Reports, 2016
2015
On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes.
Proceedings of the Advances in Cryptology  EUROCRYPT 2015, 2015
2014
Proceedings of the Selected Areas in Cryptography  SAC 2014, 2014
2012
Decoding Random Binary Linear Codes in 2<sup>n/20</sup>: How 1+1=0 Improves Information Set Decoding.
IACR Cryptol. ePrint Arch., 2012
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding.
Proceedings of the Advances in Cryptology  EUROCRYPT 2012, 2012
Proceedings of the Advances in Cryptology  ASIACRYPT 2012, 2012
2011
Dagstuhl Reports, 2011
Proceedings of the Selected Areas in Cryptography  18th International Workshop, 2011
Proceedings of the Advances in Cryptology  ASIACRYPT 2011, 2011
2010
Proceedings of the LLL Algorithm  Survey and Applications, 2010
IACR Cryptol. ePrint Arch., 2010
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.
Proceedings of the Public Key Cryptography, 2010
Proceedings of the Advances in Cryptology, 2010
2009
Proceedings of the Public Key Cryptography, 2009
Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
Proceedings of the Advances in Cryptology, 2009
2008
Solving Systems of Modular Equations in One Variable: How Many RSAEncrypted Messages Does Eve Need to Know?
Proceedings of the Public Key Cryptography, 2008
Proceedings of the Advances in Cryptology, 2008
2007
Deterministic PolynomialTime Equivalence of Computing the RSA Secret Key and Factoring.
J. Cryptol., 2007
IACR Cryptol. ePrint Arch., 2007
A Polynomial Time Attack on RSA with Private CRTExponents Smaller Than <i>N</i> <sup>0.073</sup>.
Proceedings of the Advances in Cryptology, 2007
2006
Commun. ACM, 2006
Proceedings of the Public Key Cryptography, 2006
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants.
Proceedings of the Advances in Cryptology, 2006
2005
Proceedings of the Advances in Cryptology, 2005
Proceedings of the Advances in Cryptology, 2005
2004
Proceedings of the Public Key Cryptography, 2004
Proceedings of the Public Key Cryptography, 2004
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.
Proceedings of the Advances in Cryptology, 2004
2003
PhD thesis, 2003
Proceedings of the Advances in Cryptology, 2003
2002
Proceedings of the Advances in Cryptology, 2002
2001
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001
Proceedings of the Cryptography and Lattices, International Conference, 2001
Proceedings of the Cryptography and Lattices, International Conference, 2001