Preimage attack on round-reduced Skein-512-256 compression function using SAT solver
Prikladnaya Diskretnaya Matematika · 2026 · (71) · 97-111
DOI: 10.17223/20710410/71/7 ↗Kurz gefasst
Fachartikel in der Zeitschrift Prikladnaya Diskretnaya Matematika, 2026. Verfasst von Oleg S. Zaikin.
Abstract (Originalsprache)
Consider the cryptographic hash function Skein-512-256, which became a finalist of the NIST hash function competition in 2010. Skein-512-256 compression function processes a 512-bit block message block in 72 rounds, 12 operations each. A practical algebraic preimage attack on round-reduced versions of the Skein-512-256 compression function is proposed. The corresponding computational problems are reduced to instances of the Boolean satisfiability problem (SAT). Using sequential SAT solvers, preimages of the first round and the first 7 operations of the second round of the compression function have been found. By applying a parallel SAT solver, the number of the second round’s operations has been increased to 8. Earlier, a practical preimage attack on at most 1-round Skein-512-256 compression function was published.
Zitieren
APA
Zaikin, O. S. (2026). Preimage attack on round-reduced Skein-512-256 compression function using SAT solver. Prikladnaya Diskretnaya Matematika, 97-111. https://doi.org/10.17223/20710410/71/7
Vancouver
Zaikin OS. Preimage attack on round-reduced Skein-512-256 compression function using SAT solver. Prikladnaya Diskretnaya Matematika. 2026:97-111. doi:10.17223/20710410/71/7
BibTeX
@article{Zaikin2026,
author = {Zaikin, Oleg S.},
title = {Preimage attack on round-reduced Skein-512-256 compression function using SAT solver},
journal = {Prikladnaya Diskretnaya Matematika},
year = {2026},
number = {71},
pages = {97--111},
doi = {10.17223/20710410/71/7}
}
EUVIMED