Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
From MaRDI portal
Publication:2104437
DOI10.1007/978-3-031-08896-4_10OpenAlexW3174062847MaRDI QIDQ2104437FDOQ2104437
Authors: Congming Wei, Chenhao Wu, Ximing Fu, Xiaoyang Dong, Kai He, Jue Hong, Xiaoyun Wang
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_10
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)
Cites Work
- Finding Collisions in the Full SHA-1
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- How to Break MD5 and Other Hash Functions
- Efficient Collision Search Attacks on SHA-0
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- Rotational cryptanalysis of round-reduced \textsc{Keccak}
- A crossbred algorithm for solving Boolean polynomial systems
- Beating brute force for systems of polynomial equations over finite fields
- Linear structures: applications to cryptanalysis of round-reduced \textsc{Keccak}
- Preimage attacks on round-reduced Keccak-224/256 via an allocating approach
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- Cryptanalysis of round-reduced KECCAK using non-linear structures
Cited In (1)
Uses Software
This page was built for publication: Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104437)