Published March 11, 2026
| Version v1
Preprint
Open
SHA-3 is Polynomial
Authors/Creators
Description
We prove that SHA-3 is computable in polynomial time by decomposing it into a finite sum of polynomial-time operations and invoking closure of polynomials under finite addition and composition.
Files
SHA_3_is_Polynomial.pdf
Files
(302.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:cae207899969681aec73b9daa31f6251
|
3.8 kB | Download |
|
md5:e45b74b7d19f9b51994de14113cafa82
|
298.2 kB | Preview Download |