| Finding Collisions against 4-Round SHA-3-384 in Practical Time | 0 | 0.34 | 2022 |
| Practical key recovery attacks on FlexAEAD | 0 | 0.34 | 2022 |
| Practical Related-Key Forgery Attacks on the Full TinyJAMBU-192/256. | 0 | 0.34 | 2022 |
| Inverting Binarizations Of Facial Templates Produced By Deep Learning (And Its Implications) | 0 | 0.34 | 2021 |
| Single Tweakey Cryptanalysis of Reduced-Round SKINNY-64. | 0 | 0.34 | 2020 |
| Counting Active S-Boxes is not Enough. | 0 | 0.34 | 2020 |
| A Practical Forgery Attack on Lilliput-AE | 0 | 0.34 | 2020 |
| It is All in the System's Parameters: Privacy and Security Issues in Transforming Biometric Raw Data into Binary Strings | 0 | 0.34 | 2019 |
| DNS-Morph: UDP-Based Bootstrapping Protocol For Tor. | 0 | 0.34 | 2019 |
| Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications | 1 | 0.41 | 2019 |
| DLCT: A New Tool for Differential-Linear Cryptanalysis. | 0 | 0.34 | 2019 |
| Adapting Rigidity to Symmetric Cryptography: Towards "Unswerving" Designs | 0 | 0.34 | 2019 |
| Linear Cryptanalysis Reduced Round of Piccolo-80. | 0 | 0.34 | 2019 |
| Efficient Construction of the Boomerang Connection Table. | 0 | 0.34 | 2018 |
| Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities. | 0 | 0.34 | 2018 |
| Efficient Slide Attacks. | 1 | 0.40 | 2018 |
| Reconstructing An S-Box From Its Difference Distribution Table | 0 | 0.34 | 2018 |
| Efficient Construction of the Kite Generator Revisited. | 0 | 0.34 | 2018 |
| Efficient Construction Of Diamond Structures | 0 | 0.34 | 2017 |
| No Bot Expects the DeepCAPTCHA! Introducing Immutable Adversarial Examples, With Applications to CAPTCHA Generation. | 14 | 0.74 | 2017 |
| Linear Cryptanalysis Using Low-bias Linear Approximations. | 0 | 0.34 | 2017 |
| WEM: A New Family of White-Box Block Ciphers Based on the Even-Mansour Construction. | 1 | 0.36 | 2017 |
| No Bot Expects the DeepCAPTCHA! Introducing Immutable Adversarial Examples with Applications to CAPTCHA. | 0 | 0.34 | 2016 |
| Key Recovery Attacks on Iterated Even–Mansour Encryption Schemes | 4 | 0.42 | 2016 |
| Breaching the Privacy of Israel's Paper Ballot Voting System. | 0 | 0.34 | 2016 |
| New Second Preimage Attacks on Dithered Hash Functions with Low Memory Complexity. | 0 | 0.34 | 2016 |
| New Second-Preimage Attacks on Hash Functions | 5 | 0.40 | 2016 |
| HoneyFaces: Increasing the Security and Privacy of Authentication Using Synthetic Facial Images. | 0 | 0.34 | 2016 |
| Improved Top-Down Techniques in Differential Cryptanalysis. | 4 | 0.56 | 2015 |
| New Attacks on Feistel Structures with Improved Memory Complexities. | 6 | 0.49 | 2015 |
| Slidex Attacks on the Even–Mansour Encryption Scheme | 1 | 0.35 | 2015 |
| Cryptanalysis of SP Networks with Partial Non-Linear Layers. | 4 | 0.40 | 2015 |
| Decomposing the ASASA Block Cipher Construction. | 7 | 0.45 | 2015 |
| Almost universal forgery attacks on AES-based MAC’s | 2 | 0.39 | 2015 |
| Reflections on Slide with a Twist Attacks. | 0 | 0.34 | 2014 |
| Improved Practical Attacks on Round-Reduced Keccak | 11 | 0.66 | 2014 |
| Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys. | 8 | 0.51 | 2014 |
| Dissection: a new paradigm for solving bicomposite search problems | 1 | 0.35 | 2014 |
| Improved Analysis of Zorro-Like Ciphers. | 5 | 0.44 | 2014 |
| Improved Linear Sieving Techniques with Applications to Step-Reduced LED-64. | 1 | 0.35 | 2013 |
| On the anonymity of Israel's general elections. | 2 | 0.40 | 2013 |
| Cryptanalysis of the Stream Cipher LEX | 3 | 0.40 | 2013 |
| Practical-time attacks against reduced variants of MISTY1 | 0 | 0.34 | 2013 |
| Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials. | 5 | 0.50 | 2013 |
| Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys. | 0 | 0.34 | 2013 |
| Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2 | 17 | 0.65 | 2013 |
| A Practical Related-Key Boomerang Attack for the Full MMB Block Cipher | 1 | 0.37 | 2013 |
| Low-Data Complexity Attacks on AES | 10 | 0.68 | 2012 |
| Self-Differential Cryptanalysis of Up to 5 Rounds of SHA-3. | 2 | 0.37 | 2012 |
| Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems. | 30 | 1.08 | 2012 |
