| Random Oracles and Non-Uniformity. | 6 | 0.41 | 2018 |
| Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks. | 1 | 0.34 | 2018 |
| PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. | 1 | 0.37 | 2017 |
| Provable Security of Substitution-Permutation Networks. | 0 | 0.34 | 2017 |
| Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour. | 0 | 0.34 | 2017 |
| Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. | 1 | 0.34 | 2017 |
| The Security of Tandem-DM in the Ideal Cipher Model. | 1 | 0.37 | 2017 |
| Indifferentiability of Confusion-Diffusion Networks. | 3 | 0.37 | 2016 |
| Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. | 3 | 0.37 | 2016 |
| Indifferentiability of 8-Round Feistel Networks. | 6 | 0.42 | 2016 |
| Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes | 3 | 0.39 | 2015 |
| Indifferentiability of Confusion-Diffusion Networks. | 0 | 0.34 | 2015 |
| Feistel Networks: Indifferentiability at 8 Rounds. | 0 | 0.34 | 2015 |
| Feistel Networks: Indifferentiability at 10 Rounds. | 0 | 0.34 | 2015 |
| The Security of Multiple Encryption in the Ideal Cipher Model. | 10 | 0.52 | 2014 |
| Minimizing the Two-Round Even-Mansour Cipher. | 58 | 1.36 | 2014 |
| Tight security bounds for multiple encryption. | 4 | 0.41 | 2014 |
| Counting solutions to additive equations in random sets. | 2 | 0.39 | 2013 |
| On the Indifferentiability of Key-Alternating Ciphers. | 30 | 0.82 | 2013 |
| The Distinguishability of Product Distributions by Read-Once Branching Programs. | 5 | 0.45 | 2013 |
| Tight security bounds for key-alternating ciphers. | 63 | 1.48 | 2013 |
| Multiproperty-Preserving Domain Extension Using Polynomial-Based Modes of Operation | 7 | 0.48 | 2012 |
| Stam's Conjecture and Threshold Phenomena in Collision Resistance. | 6 | 0.42 | 2012 |
| Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract). | 31 | 1.02 | 2012 |
| Improved Security Bounds for Key-Alternating Ciphers via Hellinger Distance. | 26 | 0.89 | 2012 |
| The Lowest-Degree Polynomial with Nonnegative Coefficients Divisible by the n-th Cyclotomic Polynomial. | 0 | 0.34 | 2012 |
| Stam’s collision resistance conjecture | 10 | 0.56 | 2010 |
| Tilings of the integers can have superpolynomial periods | 0 | 0.34 | 2009 |
| The Collision Intractability of MDC-2 in the Ideal-Cipher Model | 49 | 2.71 | 2007 |
| Indecomposable Tilings of the Integers with Exponentially Long Periods | 1 | 0.43 | 2005 |
| A class of prototiles with doubly generated level semigroups | 2 | 0.62 | 2004 |
