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.
Demander à l'IA
Like
Bookmark
Share
View Full Paper
Cite This Study
Kaoru Aguilera Katayama (Wed,) studied this question.