CITS » Mitarbeiter » Mitarbeiter

Survey

• Alexander May
  "Lattice-based Integer Factorization - An Introduction to Coppersmith's Method", Author version of book chapter in Computational Cryptography - Algorithmic Aspects of Cryptology, Cambridge University Press, 2021.
• Alexander May
  "Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey" LLL+25 Conference in honour of the 25th birthday of the LLL algorithm, 2007.

Conference Publications

• Alexander May, Julian Nowakowski,
  "Too Many Hints - When LLL Breaks LWE" , In Advances in Cryptology (Asiacrypt 2023).
• Alexander May, Carl Richard Theodor Schneider,
  "Dlog is Practically as Hard (or Easy) as DH – Solving Dlogs via DH Oracles on EC Standards" , In Transactions on Cryptographic Hardware and Embedded Systems (TCHES 2023), ISSN 2569-2925, 2023.
• Elena Kirshanova, Alexander May, Julian Nowakowski,
  "New NTRU Records with Improved Lattice Bases" , In International Conference on Post-Quantum Cryptography (PQCrypto 2023)
• Timo Glaser, Alexander May,
  "How to Enumerate LWE Keys as Narrow as in Kyber/Dilithium" , In Conference on Cryptology and Network Security (CANS 2023), 2023.
• Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May,
  "Low Memory Attacks on Small Key CSIDH" , In International Conference on Applied Cryptography and Network Security (ACNS 2023), Lecture Notes in Computer Science, Springer-Verlag, 2023.
• Andre Esser, Alexander May, Javier Verbel, Weiqiang Wen,
  "Partial Key Exposure Attacks on BIKE, Rainbow and NTRU", In Advances in Cryptology (Crypto 2022), Lecture Notes in Computer Science, Springer-Verlag, 2022.
• Elena Kirshanova, Alexander May,
  "Decoding McEliece with a Hint – Secret Goppa Key Parts Reveal Everything", In Conference on Security and Cryptography for Networks (SCN 2022), Lecture Notes in Computer Science, Springer-Verlag, 2022.
• Alexander May, Julian Nowakowski, Santanu Sarkar,
  "Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents", In Advances in Cryptology (Eurocrypt 2022), Lecture Notes in Computer Science, Springer-Verlag, 2022.
• Andre Esser, Alexander May, Floyd Zweydinger,
  "McEliece needs a Break -- Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD", In Advances in Cryptology (Eurocrypt 2022), Lecture Notes in Computer Science, Springer-Verlag, 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", to appear at Security & Privacy (S&P 2022), Oakland, 2022.
• Alexander May, Floyd Zweydinger,
  "Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing", IEEE Computer Security Foundations Symposium (CSF 2022), IEEE Computer Society Press, 2022.
• Alexander May, Lars Schlieper,
  "Quantum Period Finding is Compression Robust", In Transactions on Symmetric Cryptology (TOSC 2022), 2022.
• Alexander May, Julian Nowakowski, Santanu Sarkar,
  "Partial Key Exposure Attack on Short Secret Exponent CRT-RSA" , In Advances in Cryptology (Asiacrypt 2021), Lecture Notes in Computer Science, Springer-Verlag, 2021.
  
• "How to Find Ternary LWE Keys Using Locality Sensitive Hashing" , IMA International Conference on Cryptography and Coding (IMACC 2021), 2021.
• Mar­kus Dür­muth, Ma­xi­mi­li­an Golla, Phil­ipp Mar­kert, Alex­an­der May, Lars Schlie­per,
  "Towards Quantum Large-Scale Password Guessing on Real-World Distributions", In­ter­na­tio­nal Con­fe­rence on Cryp­to­lo­gy and Net­work Se­cu­ri­ty 2021 (CANS 2021), Lecture Notes in Computer Science, Springer-Verlag, 2021.
  
• Alexander May
  "How to Meet Ternary LWE Keys" , In Advances in Cryptology (Crypto 2021), Lecture Notes in Computer Science, Springer-Verlag, 2021.
  
• Elena Kirshanova, Iggy van Hoof, Alexander May
  "Quantum Key Search for Ternary LWE", In International Conference on Post-Quantum Cryptography (PQCrypto 2021), Lecture Notes in Computer Science, 2021.
  
• Alexander May, Lars Schlieper, Jonathan Schwinger,
  "Noisy Simon Period Finding", Topics in Cryptology (CT-RSA 2021), Lecture Notes in Computer Science, Springer-Verlag, 2021.
• Andre Esser, Alexander May,
  "Low Weight Discrete Logarithms and Subset Sum in 2^0.65n with Polynomial Memory" , In Advances in Cryptology (Eurocrypt 2020), Lecture Notes in Computer Science, Springer-Verlag, 2020.
  
• Alexander Helm, Alexander May
  "The Power of Few Qubits and Collisions - Subset Sum below Grover's Bound", In International Conference on Post-Quantum Cryptography (PQCrypto 2020), Lecture Notes in Computer Science, 2020.
• Claire Deplace, Andre Esser, Alexander May,
  "Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions" , IMA International Conference on Cryptography and Coding (IMACC 2019), 2019.
• Claire Deplace, Alexander May,
  "Can we Beat the Square Root Bound for ECDLP over F_p^2
  via Representations?", Number Theoretic Methods in Cryptology (NuTMiC 2019), 2019.
• Tibor Jager, Saqib A. Kakvi, Alexander May,
  "On the Security of the PKCS#1 v1.5 Signature Scheme" , In 25th ACM Conference on Computer and Communications Security (CCS 2018), ACM Digital Library, 2018.
• Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler
  "Dissection BKW" , In Advances in Cryptology (Crypto 2018), Lecture Notes in Computer Science, Springer-Verlag, 2018.
• Alexander Helm, Alexander May
  "Subset Sum Quantumly in 1.17^n" , In Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018), Leibniz International Proceedings in Informatics, 2018.
• Leif Both, Alexander May
  "Decoding Linear Codes with High Error Rate and its Impact for LPN Security", In International Conference on Post-Quantum Cryptography (PQCrypto 2018), Lecture Notes in Computer Science, 2018.
• Gregor Leander, Alexander May
  "Grover Meets Simon – Quantumly Attacking the FX-construction" , In Advances in Cryptology (Asiacrypt 2017), Lecture Notes in Computer Science, Springer-Verlag, 2017.
  
• Leif Both, Alexander May
  "Optimizing BJMM with Nearest Neighbors: Full Decoding in 2^{2n/21} and McEliece Security", In International Workshop on Coding and Cryptography (WCC 2017), 2017.
  
• Andre Esser, Robert Kübler, Alexander May
  "LPN Decoded" , In Advances in Cryptology (Crypto 2017), Lecture Notes in Computer Science, Springer-Verlag, 2017.
  
• Gottfried Herold, Alexander May
  "LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE" , In International Conference on Practice and Theory of Public-Key Cryptography (PKC 2017), Lecture Notes in Computer Science, Springer-Verlag, 2017.
  
• Low Memory Attacks on Small Key CSIDH
  Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May "Parallel Implementation of BDD enumeration for LWE" , In International Conference on Applied Cryptography and Network Security (ACNS 2016), Lecture Notes in Computer Science, Springer-Verlag, 2016.
  
• Alexander May, Ilya Ozerov
  "On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes" , In Advances in Cryptology (Eurocrypt 2015), Lecture Notes in Computer Science, Springer-Verlag, 2015.
  
• Alexander May, Ilya Ozerov
  "A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups" , In Selected Areas in Cryptography (SAC 2014), Lecture Notes in Computer Science, Springer-Verlag, 2014.
  
• Saqib A. Kakvi, Eike Kiltz, Alexander May
  "Certifying RSA" , In Advances in Cryptology (Asiacrypt 2012), Lecture Notes in Computer Science Volume 7658, 404-414, Springer-Verlag, 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" , In Advances in Cryptology (Eurocrypt 2012), Lecture Notes in Computer Science, Springer-Verlag, 2012.
  
• Alexander May, Alexander Meurer, Enrico Thomae
  "Decoding Random Linear Codes in O(2^{0.054n})" , In Advances in Cryptology (Asiacrypt 2011), Lecture Notes in Computer Science, Springer-Verlag, 2011.
  
• Jake Loftus, Alexander May, Nigel P. Smart, Frederik Vercauteren
  "On CCA-Secure Somewhat Homomorphic Encryption" , In Selected Areas in Cryptography (SAC 2011), Lecture Notes in Computer Science, Springer-Verlag, 2011.
  
• Wilko Henecka, Alexander May, Alexander Meurer
  "Correcting Errors in RSA Private Keys" In Advances in Cryptology (Crypto 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010.
  
• Mathias Herrmann, Alexander May
  "Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA"In Practice and Theory in Public Key Cryptography (PKC 2010), Lecture
  Notes in Computer Science, Springer-Verlag, 2010.
  
• Mathias Herrmann, Alexander May
  "Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?" In Advances in Cryptology (Asiacrypt 2009), Lecture Notes in Computer Science, Springer-Verlag, 2009.
  
• Alexander May, Maike Ritzenhofen
  "Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint" In Practice and Theory in Public Key Cryptography (PKC 2009), Lecture Notes in Computer Science, Springer-Verlag, 2009.
  
• Mathias Herrmann, Alexander May
  "Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits" In Advances in Cryptology (Asiacrypt 2008), Lecture Notes in Computer Science, Springer-Verlag, 2008.
  
• Alexander May, Maike Ritzenhofen
  "Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?"
  In Practice and Theory in Public Key Cryptography (PKC 2008), Lecture Notes in Computer Science Volume 4939, pages 37-46, Springer-Verlag, 2008.
  
• Ellen Jochemz, Alexander May
  "A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N^0.073" In Advances in Cryptology (Crypto 2007), Lecture Notes in Computer Science, Springer-Verlag, 2007.
  
• Ellen Jochemz, Alexander May
  "A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants"
  In Advances in Cryptology (Asiacrypt 2006), Lecture Notes in Computer Science, Springer-Verlag, 2006.
  
• Daniel Bleichenbacher, Alexander May
  "New Attacks on RSA with Small Secret CRT-Exponents" In Practice and Theory in Public Key Cryptography (PKC 2006), Lecture
  Notes in Computer Science, Springer-Verlag, 2006.
  
• Johannes Blömer, Alexander May
  "A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers" In Advances in Cryptology (Eurocrypt 2005), Lecture Notes in Computer Science Volume 3494, pages 251-267, Springer-Verlag, 2005.
  
• Matthias Ernst, Ellen Jochemsz, Alexander May and Benne de Weger
  "Partial Key Exposure Attacks on RSA up to Full Size Exponents"In Advances in Cryptology (Eurocrypt 2005), Lecture Notes in Computer Science Volume 3494, pages 371-386, Springer-Verlag, 2005.
  
• Alexander May
  "Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring"In Advances in Cryptology (Crypto 2004), Lecture Notes in Computer Science Volume 3152, pages 213-219, Springer Verlag, 2004.
  
• Alexander May
  "Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq"In Practice and Theory in Public Key Cryptography (PKC 2004), Lecture Notes in Computer Science Volume 2947, pages 218-230, Springer-Verlag,
  2004.
  
• Johannes Blömer, Alexander May
  "A Generalized Wiener Attack on RSA"
  In Practice and Theory in Public Key Cryptography (PKC 2004), Lecture Notes in Computer Science Volume 2947, pages 1-13, Springer-Verlag, 2004.
  
• Johannes Blömer, Alexander May
  "New Partial Key Exposure Attacks on RSA" In Advances in Cryptology (Crypto 2003), Lecture Notes in Computer Science Volume 2729, pages 27-43, Springer Verlag, 2003.
  
• Alexander May
  "Cryptanalysis of Unbalanced RSA with Small CRT-Exponent", In Advances in Cryptology (Crypto 2002), Lecture Notes in Computer Science Volume 2442, pages 242-256, Springer Verlag, 2002.
  
• Johannes Blömer, Alexander May
  "Key Revocation with Interval Cover Families" In Selected Areas in Cryptography (SAC 2001), Lecture Notes in Computer
  Science Volume 2259, pages 325-341, Springer-Verlag, 2001.
  
• Alexander May, Joseph H. Silverman
  "Dimension Reduction Methods for Convolution Modular Lattices"
  In Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in
  Computer Science Volume 2146, pages 110-125, Springer-Verlag, 2001.
  
• Johannes Blömer, Alexander May
  "Low Secret Exponent RSA Revisited"
  In Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science Volume 2146, pages 4-19, Springer-Verlag, 2001.
  
• Alexander May
  "Cryptanalysis of NTRU-107" (Note: Preprint).

Journal Publications

• Alexander May, Lars Schlieper,
  "Quantum Period Finding is Compression Robust", In Transactions on Symmetric Cryptology (TOSC 2022), 2022.
• Leif Both, Alexander May
  "The Approximate k-List Problem" , In Transactions on Symmetric Cryptology (TOSC 2017), DOI: http://dx.doi.org/10.13154/tosc.v2017.i1.380-397, 2017.
• Gottfried Herold, Elena Kirshanova, Alexander May
  "On the Asymptotic Complexity of Solving LWE" , In International Journal of Design, Codes and Cryptography, Springer-Verlag, 2017.
• Jean-Sébastien Coron, Alexander May
  "Deterministic Polynomial Time Equivalent of Computing the RSA Secret Key and Factoring", Journal of Cryptology, 2006
  
• Johannes Buchmann, Alexander May, Ulrich Vollmer
  "Perspectives for Cryptographic Long-Term Security", Communications of the ACM, Vol. 94(9), 2006
  
• Johannes Buchmann, Erik Dahmen, Alexander May, Ulrich Vollmer
  "Krypto 2020", KES - The Information Security Journal, Nr 5, 2006

PhD Thesis

• "New RSA Vulnerabilities Using Lattice Reduction Methods", University of Paderborn, 2003.

Diploma Thesis

• "Auf Polynomgleichungen basierende Public-Key-Kryptosysteme", University of Frankfurt/Main, 1999

Letzte Änderung: 25.08.2023  | Impressum | privacy notice | Ansprechpartner/in: Inhalt & Technik | Layout: Normal | Kontrast | Druck