| year | title | booktitle | pages |
|---|
| 1 | 2018 | A New Public-Key Cryptosystem via Mersenne Numbers | crypto | 459-482 |
| 2 | 2018 | How to Securely Compute with Noisy Leakage in Quasilinear Complexity | asiacrypt | 547-574 |
| 3 | 2015 | Cryptanalysis of SHA-0 and Reduced SHA-1 | jofc | 110-160 |
| 4 | 2015 | Nearly Sparse Linear Algebra | eprint | 930 |
| 5 | 2015 | Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search | eprint | 522 |
| 6 | 2014 | Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus | eurocrypt | online |
| 7 | 2014 | A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic | eurocrypt  | online |
| 8 | 2014 | Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE | asiacrypt | online |
| 9 | 2014 | Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields | asiacrypt | online |
| 10 | 2013 | Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields | eurocrypt | online |
| 11 | 2012 | Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $F_(p^6)$ | eurocrypt | online |
| 12 | 2012 | Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding | eurocrypt | online |
| 13 | 2012 | A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract) | eurocrypt | online |
| 14 | 2012 | Towards Super-Exponential Side-Channel Security with Efficient Leakage-Resilient PRFs | ches | online |
| 15 | 2011 | Cryptanalysis of the RSA Subgroup from TCC 2005 | pkc | online |
| 16 | 2011 | Improved Generic Algorithms for Hard Knapsacks | eurocrypt | online |
| 17 | 2011 | Fast Software Encryption - 18th International Workshop, FSE 2011, Lyngby, Denmark, February 13-16, 2011, Revised Selected Papers | fse | online |
| 18 | 2010 | Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields. Application to the static Diffie-Hellman problem on $E(\F_{q^5})$ | eprint | online |
| 19 | 2010 | A variant of the F4 algorithm | eprint | online |
| 20 | 2010 | New generic algorithms for hard knapsacks | eprint | online |
| 21 | 2010 | Pairing computation on curves with efficiently computable endomorphism and small embedding degree | eprint | online |
| 22 | 2010 | New Generic Algorithms for Hard Knapsacks | eurocrypt | online |
| 23 | 2009 | Improved Generic Algorithms for 3-Collisions | asiacrypt | online |
| 24 | 2009 | Factoring pq2 with Quadratic Forms: Nice Cryptanalyses | asiacrypt | online |
| 25 | 2009 | Fault Attacks on RSA Signatures with Partially Unknown Messages | ches | online |
| 26 | 2009 | On the Security of Iterated Hashing based on Forgery-resistant Compression Functions | eprint | online |
| 27 | 2008 | Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms | eprint | online |
| 28 | 2008 | Another approach to pairing computation in Edwards coordinates | eprint | online |
| 29 | 2007 | When e-th Roots Become Easier Than Factoring | asiacrypt | online |
| 30 | 2007 | Hash Functions and the (Amplified) Boomerang Attack | crypto | online |
| 31 | 2007 | Toward a Rigorous Variation of Coppersmith's Algorithm on Three Variables | eurocrypt | online |
| 32 | 2007 | Overtaking VEST | fse | online |
| 33 | 2007 | When e-th Roots Become Easier Than Factoring | eprint | online |
| 34 | 2006 | Inverting HFE Is Quasipolynomial | crypto | online |
| 35 | 2006 | The Number Field Sieve in the Medium Prime Case | crypto | online |
| 36 | 2006 | The Function Field Sieve in the Medium Prime Case | eurocrypt | online |
| 37 | 2006 | Chosen-Ciphertext Attacks Against MOSQUITO | fse | online |
| 38 | 2006 | Counting points on elliptic curves in medium characteristic | eprint | online |
| 39 | 2005 | Collisions of SHA-0 and Reduced SHA-1 | eurocrypt | online |
| 40 | 2005 | Two Attacks Against the HBB Stream Cipher | fse | online |
| 41 | 2005 | Cryptanalysis of the Tractable Rational Map Cryptosystem | pkc | online |
| 42 | 2004 | Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions | crypto | online |
| 43 | 2004 | Cryptanalysis of a Provably Secure Cryptographic Hash Function | eprint | online |
| 44 | 2004 | A One Round Protocol for Tripartite Diffie-Hellman | jofc | 263-276 |
| 45 | 2003 | Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases | crypto | online |
| 46 | 2003 | Cryptanalysis of the EMD Mode of Operation | eurocrypt | online |
| 47 | 2003 | Loosening the KNOT | fse | online |
| 48 | 2003 | New Attacks against Standardized MACs | fse | online |
| 49 | 2003 | Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups | jofc | 239-247 |
| 50 | 2002 | Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Models: CBC, GEM, IACBC | crypto | online |
| 51 | 2002 | Fast Correlation Attacks: An Algorithmic Point of View | eurocrypt | online |
| 52 | 2002 | On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit: A New Construction | fse | online |
| 53 | 2001 | Cryptanalysis of PKP: A New Approach | pkc | 165-172 |
| 54 | 2001 | Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups | eprint | online |
| 55 | 2001 | On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction | eprint | online |
| 56 | 2000 | Why Textbook ElGamal and RSA Encryption Are Insecure | asiacrypt | 30-43 |
| 57 | 2000 | A Chosen-Ciphertext Attack against NTRU | crypto | online |
| 58 | 2000 | A NICE Cryptanalysis | eurocrypt | online |
| 59 | 2000 | A Statistical Attack on RC6 | fse | 64-74 |
| 60 | 1998 | Differential Collisions in SHA-0 | crypto | 56-71 |
| 61 | 1998 | Lattice Reduction: A Toolbox for the Cryptanalyst | jofc | 161-185 |
| 62 | 1994 | A Practical Attack against Knapsack based Hash Functions (Extended Abstract) | eurocrypt | 58-66 |
| 63 | 1991 | Cryptanalysis of Another Knapsack Cryptosystem | asiacrypt | 470-476 |
| 64 | 1991 | The Cryptoanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks | crypto | 204-212 |
