preprint
Open access
SHA-3 is Polynomial
Research footprint
At a glance
- Citations
- 0
- References
- 0
- Comments
- 0
Paper overview
Öz
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.
Record transparency
Publication details
- DOI
- 10.5281/zenodo.18969636
- OpenAlex
- W7134930419
- Document type
- preprint
- Language
- EN
- Source
- Zenodo (CERN European Organization for Nuclear Research)
- Last metadata update
Comments
Oturum Açın to join the discussion.