An Improved Algebraic Attack on Hamsi-256
From MaRDI portal
Publication:3013079
DOI10.1007/978-3-642-21702-9_6zbMath1282.94041OpenAlexW178840540MaRDI QIDQ3013079
Publication date: 7 July 2011
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21702-9_6
Related Items (3)
A New Criterion for Avoiding the Propagation of Linear Relations Through an Sbox ⋮ An Improved Algebraic Attack on Hamsi-256 ⋮ Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
Cites Work
- An Improved Algebraic Attack on Hamsi-256
- Finding Second Preimages of Short Messages for Hamsi-256
- Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
- Distinguishers for the Compression Function and Output Transformation of Hamsi-256
- MD4 is Not One-Way
- Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
- Message Recovery and Pseudo-preimage Attacks on the Compression Function of Hamsi-256
- Algorithmic Cryptanalysis
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
This page was built for publication: An Improved Algebraic Attack on Hamsi-256