SHA-3 is Polynomial

Zenodo (CERN European Organization for Nuclear Research) 2026 Preprint Open access

Read full text
Authors: Kaoru Aguilera Katayama
DOI: 10.5281/zenodo.18969635
Cited by: 0

Abstract

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.

Fields of Study & Subjects

Cryptographic Implementations and Security Cryptography and Data Security Coding theory and cryptography

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
11 March 2026
Language
EN
Document type
Preprint