| Publication | Date of Publication | Type |
|---|
| Secure commitment against a powerful adversary | 2022-08-18 | Paper |
| Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA | 2021-03-09 | Paper |
| Balancing sums of random vectors | 2019-01-09 | Paper |
| An Average Case NP-complete Graph Colouring Problem | 2018-11-05 | Paper |
| New Constructions for Secure Hash Functions | 2018-05-09 | Paper |
| Rigorous analysis of a randomised number field sieve | 2018-05-04 | Paper |
| Coins, weights and contention in balancing networks | 2017-09-29 | Paper |
| Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes | 2015-11-11 | Paper |
| Non-abelian analogs of lattice rounding | 2015-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501847 | 2015-08-14 | Paper |
| Foiling Birthday Attacks in Length-Doubling Transformations | 2014-08-20 | Paper |
| Founding Cryptography on Tamper-Proof Hardware Tokens | 2010-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3400314 | 2010-02-05 | Paper |
| Tamper-Tolerant Software: Modeling and Implementation | 2009-10-28 | Paper |
| Expander graphs based on GRH with an application to elliptic curve cryptography | 2009-05-28 | Paper |
| Inversion Attacks on Secure Hash Functions Using sat Solvers | 2009-03-10 | Paper |
| Digit Set Randomization in Elliptic Curve Cryptography | 2009-03-05 | Paper |
| Constraint-Based Invariant Inference over Predicate Abstraction | 2009-02-10 | Paper |
| Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys | 2009-02-10 | Paper |
| Non-Degeneracy of Pollard Rho Collisions | 2009-01-20 | Paper |
| MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers | 2008-04-17 | Paper |
| On the Bits of Elliptic Curve Diffie-Hellman Keys | 2008-04-11 | Paper |
| Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? | 2008-03-18 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Algorithmic Number Theory | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664828 | 2005-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737503 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738935 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414201 | 2003-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414224 | 2003-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801061 | 2003-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801070 | 2003-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234095 | 2002-01-29 | Paper |
| Perfect zero-knowledge arguments for NP using any one-way permutation | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934711 | 2000-01-31 | Paper |
| Breaking RSA may not be equivalent to factoring | 1999-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318694 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249644 | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249640 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249346 | 1999-06-17 | Paper |
| Design of Practical and Provably Good Random Number Generators | 1999-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886027 | 1997-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886087 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858457 | 1996-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287362 | 1994-04-12 | Paper |
