| Publication | Date of Publication | Type |
|---|
| A complete analysis of the BKZ lattice reduction algorithm | 2025-01-17 | Paper |
| On counterexamples to the Mertens conjecture | 2024-12-16 | Paper |
| Computing a lattice basis revisited | 2020-09-10 | Paper |
| Quantum lattice enumeration and tweaking discrete pruning | 2018-12-20 | Paper |
| Lower bounds on lattice enumeration with extreme pruning | 2018-09-26 | Paper |
| Random sampling revisited: lattice enumeration with discrete pruning | 2017-06-13 | Paper |
| Counting co-cyclic lattices | 2016-07-22 | Paper |
| Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems | 2016-07-15 | Paper |
| Low-dimensional lattice basis reduction revisited | 2014-11-18 | Paper |
| Approximating the densest sublattice from Rankin's inequality | 2014-09-05 | Paper |
| Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences | 2014-03-25 | Paper |
| Lattice-based fault attacks on signatures | 2013-07-09 | Paper |
| Faster Gaussian lattice sampling using lazy floating-point arithmetic | 2013-03-19 | Paper |
| Learning a zonotope and more: cryptanalysis of ntrusign countermeasures | 2013-03-19 | Paper |
| Solving BDD by enumeration: an update | 2013-03-18 | Paper |
| Cryptanalysis vs. provable security | 2013-01-07 | Paper |
| Breaking fully-homomorphic-encryption challenges. (Abstract) | 2012-07-20 | Paper |
| Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers | 2012-06-29 | Paper |
| BKZ 2.0: Better lattice security estimates | 2011-12-02 | Paper |
| Lattice Reduction Algorithms: Theory and Practice | 2011-05-27 | Paper |
| An LLL algorithm with quadratic complexity | 2010-07-07 | Paper |
| Lattice enumeration using extreme pruning | 2010-06-01 | Paper |
| Hermite’s Constant and Lattice Algorithms | 2010-03-05 | Paper |
| Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses | 2009-12-15 | Paper |
| How Risky Is the Random-Oracle Model? | 2009-10-20 | Paper |
| Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures | 2009-05-08 | Paper |
| Public-key cryptanalysis | 2009-03-16 | Paper |
| Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 | 2009-03-10 | Paper |
| Finding short lattice vectors within Mordell's inequality | 2009-01-05 | Paper |
| Sieve algorithms for the shortest vector problem are practical | 2008-11-07 | Paper |
| Floating-Point LLL Revisited | 2008-05-06 | Paper |
| Predicting Lattice Reduction | 2008-04-15 | Paper |
| Adapting Density Attacks to Low-Weight Knapsacks | 2008-03-18 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Testing set proportionality and the Ádám isomorphism of circulant graphs | 2007-11-05 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures | 2007-09-24 | Paper |
| Symplectic Lattice Reduction and NTRU | 2007-09-24 | Paper |
| New Chosen-Ciphertext Attacks on NTRU | 2007-09-04 | Paper |
| Rankin’s Constant and Blockwise Lattice Reduction | 2007-09-04 | Paper |
| Algorithmic Number Theory | 2007-05-02 | Paper |
| Fast Software Encryption | 2006-06-22 | Paper |
| Noisy polynomial interpolation and noisy Chinese remaindering | 2006-03-01 | Paper |
| Public Key Cryptography - PKC 2005 | 2005-12-07 | Paper |
| Algorithmic Number Theory | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736443 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474163 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472073 | 2004-08-03 | Paper |
| The insecurity of the elliptic curve digital signature algorithm with partially known nonces | 2003-11-10 | Paper |
| The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm | 2003-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409120 | 2003-06-30 | Paper |
| Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787205 | 2003-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787202 | 2003-01-09 | Paper |
| The insecurity of the digital signature algorithm with partially known nonces | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249332 | 2002-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2739436 | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762741 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708632 | 2001-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708631 | 2001-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707399 | 2001-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707398 | 2001-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941845 | 2000-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250818 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249280 | 2000-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263436 | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364552 | 1998-03-10 | Paper |
