Published March 11, 2026
| Version v2
Preprint
Open
SHA-3 is Polynomial: Preimage Computation in P
Authors/Creators
Description
We prove that SHA-3 is in P by decomposition into finite polynomial-time oper- ations. As a direct corollary, we show that the preimage problem for SHA-3 is also in P, breaking its one-way function assumption.
Files
SHA_3_is_Polynomial__Preimage_Computation_in_P.pdf
Files
(347.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:3b5c06d3c388ee507c6dccc5d64ad75a
|
5.3 kB | Download |
|
md5:a2e6177657bc8cece56901a53cde0b14
|
342.6 kB | Preview Download |