Publikationen
- 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 2009), Lecture Notes in Computer Science, Springer-Verlag, 2011.
PDF
- Albrecht Petzoldt, Enrico Thomae, Stanislav Bulygin, Christopher Wolf
Small Public Keys and Fast Verification for Multivariate Quadratic Public Key Systems
Cryptographic Hardware and Embedded Systems (CHES 2011), Lecture Notes in Computer Science, Springer-Verlag, 2011.
PDF
- Enrico Thomae, Christopher Wolf
Roots of Square: Cryptanalysis of Double-Layer Square and Square+
Post-Quantum Cryptography (PQCrypto 2011), Lecture Notes in Computer Science, Springer-Verlag, 2011.
PDF
- Enrico Thomae, Christopher Wolf
Theoretical Analysis and Run Time Complexity of MutantXL
International Conference Computational and Mathematical Methods in Science and Engineering (CMMSE 2011), 2011.
PDF
- 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.
Abstract 
PDF
- Maike Ritzenhofen
On Efficiently Calculating Small Solutions of Systems of Polynomial Equations - Lattice-Based Methods and Applications to Cryptography
Dissertation, Ruhr-University of Bochum, 2010
Abstract PDF
- Mathias Herrmann, Alexander May
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
To appear: In Practice and Theory in Public Key Cryptography (PKC 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010.
Abstract, BibTex PDF
- 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.
Abstract, BibTex Download
- 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.
Abstrakt, BibTex, Download
- Mathias Herrmann, Gregor Leander
A Practical Key Recovery Attack on Basic TCHo
In Practice and Theory in Public Key Cryptography (PKC 2009), Lecture Notes in Computer Science, Springer-Verlag, 2009.
Abstract, BibTex, Download
- 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.
Abstract, BibTex
- 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.
Abstract, BibTex
