ملف الباحث
Kaoru Aguilera Katayama
ورقتان في مجموعة PaperMetrix
المنشورات
أوراق هذا المؤلف
-
On the Structural Impossibility of Hash Collision Finding\\ via Direct SAT Duplication Why Encoding $H(x_1) = H(x_2) \wedge x_1 \neq x_2$ as a Duplicated SAT Circuit is Inherently Unsatisfiable
2026 · Zenodo (CERN European Organization for Nuclear Research)
We present a fundamental structural observation regarding the encoding of hash function collision search as a Boolean Satisfiability (SAT) problem. The standard approach to finding collisions $H(x_1) = H(x_2)$ with $x_1 \neq x_2$ requires instantiating …
-
SHA-3 is Polynomial
2026 · Zenodo (CERN European Organization for Nuclear Research)
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.