What question did this study set out to answer?

The study aims to demonstrate that SHA-3 operates within polynomial time complexity, impacting its security properties.

March 13, 2026Open Access

SHA-3 is Polynomial: Preimage Computation in P

Key Points

The study aims to demonstrate that SHA-3 operates within polynomial time complexity, impacting its security properties.
Decomposition of SHA-3 into finite polynomial-time operations
Mathematical proofs of polynomial-time characteristics
Analysis of the preimage problem in the context of SHA-3
SHA-3 is shown to be in polynomial time (P)
The preimage problem for SHA-3 is also classified within P
This classification challenges the one-way function assumption of SHA-3

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.

Ask AI

Helpful

Bookmark

View Full Paper

Cite This Study

Kaoru Aguilera Katayama (Wed,) studied this question.

synapsesocial.com/papers/69b3ac7002a1e69014cce1ae https://doi.org/https://doi.org/10.5281/zenodo.18969635

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Ask AI

Helpful

Bookmark

View Full Paper