most citedThe Existence of the Tau One-Way Functions Class as a Proof that P != NP

3 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2016

The Security of Hardware-Based Omega(n^2) Cryptographic One-Way Functions: Beyond Satisfiability and P=NP

Javier A. Arroyo-Figueroa

We present a class of hardware-based cryptographic one-way functions that, in practice, would be hard to invert even if P=NP and linear-time satisfiability algorithms exist. Such f…

cs.CC2016★ 3 cited

The Existence of the Tau One-Way Functions Class as a Proof that P != NP

Javier A. Arroyo-Figueroa

We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a fun…