Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
From MaRDI portal
Publication:3084240
DOI10.1007/978-3-642-19574-7_1zbMath1290.94048OpenAlexW1948713329MaRDI QIDQ3084240
Anne Canteaut, Christina Boura
Publication date: 15 March 2011
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19574-7_1
Related Items (12)
LHash: A Lightweight Hash Function ⋮ Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials ⋮ Rotational Cryptanalysis of Round-Reduced Keccak ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Distinguishing error of nonlinear invariant attacks ⋮ Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting ⋮ An Improved Algebraic Attack on Hamsi-256 ⋮ Higher-Order Differential Properties of Keccak and Luffa ⋮ Antiderivative functions over \(\mathbb{F}_{2^n}\) ⋮ Improving the security and efficiency of block ciphers based on LS-designs ⋮ On the Multi-output Filtering Model and Its Applications ⋮ Improved practical attacks on round-reduced Keccak
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
- Distinguishers for the Compression Function and Output Transformation of Hamsi-256
- Security Bounds for the Design of Code-Based Cryptosystems
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- The block cipher Square
- Known-Key Distinguishers for Some Block Ciphers
This page was built for publication: Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256