Programming the Demirci-Selçuk meet-in-the-middle attack with constraints
From MaRDI portal
Publication:1710587
DOI10.1007/978-3-030-03329-3_1zbMath1446.94157OpenAlexW2898254287MaRDI QIDQ1710587
Patrick Derbez, Bing Sun, Lei Hu, Yosuke Todo, Danping Shi, Siwei Sun
Publication date: 23 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-03329-3_1
Related Items (13)
Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ Related-tweakey impossible differential attack on reduced-round \texttt{SKINNY-AEAD} M1/M3 ⋮ Key guessing strategies for linear key-schedule algorithms in rectangle attacks ⋮ Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT ⋮ Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework ⋮ Improved graph-based model for recovering superpoly on Trivium ⋮ Exploiting non-full key additions: full-fledged automatic Demirci-Selçuk meet-in-the-middle cryptanalysis of SKINNY ⋮ Finding the impossible: automated search for full impossible-differential, zero-correlation, and integral attacks ⋮ Optimizing rectangle attacks: a unified and generic framework for key recovery ⋮ Differential meet-in-the-middle cryptanalysis ⋮ Automated key recovery attacks on round-reduced Orthros ⋮ New algorithm for exhausting optimal permutations for generalized Feistel networks ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing
This page was built for publication: Programming the Demirci-Selçuk meet-in-the-middle attack with constraints
