What question did this study set out to answer?

The goal is to demonstrate that SHA-3 can be computed efficiently in polynomial time.

March 13, 2026Open Access

SHA-3 is Polynomial

Key Points

The goal is to demonstrate that SHA-3 can be computed efficiently in polynomial time.
Decomposed SHA-3 into a finite sum of operations.
Invoked closure of polynomials under finite addition.
Examined properties of polynomial-time computations.
Established that SHA-3 operations can be computed in polynomial time.
Showed closure under additional operations supports this computation model.

Abstract

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.

اسأل الذكاء الاصطناعي

Bookmark

View Full Paper

Cite This Study

Kaoru Aguilera Katayama (Wed,) studied this question.

synapsesocial.com/papers/69b3ac0a02a1e69014ccd676 https://doi.org/https://doi.org/10.5281/zenodo.18969636

Also Consider

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

اسأل الذكاء الاصطناعي

Bookmark

View Full Paper