A-Z | Übersicht | Suche | Kontakt

• Lehrstuhl
  • Startseite
  • Mitarbeiter
  • Kontakt
• Lehre
  • Lehrveranstaltungen
  • Abschlussarbeiten
    • Offene Themen
    • Laufende Arbeiten
    • Abgeschlossene Arbeiten
• Forschung
  • Publikationen
  • Projekte
  • Konferenzen
• Mystery-Twister
• Intern

Alexander May

Lehrstuhl für Kryptologie und IT-Sicherheit
Ruhr-Universität Bochum
Besucheranschrift: Universitätsstr. 140, D-44799 Bochum, Gebäude MC,Erdgeschoss Raum 29
Postanschrift: Universitätsstr. 150, D-44801 Bochum, MC-0.29, Fach 4
Tel.: +49 (0)234 32 23261
Fax.: +49 (0)234 32 14430
E-Mail: alex.may(at)ruhr-uni-bochum.de
Sprechstunde: Mi. 13:30 in MC-0-29

• 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
  "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, 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.