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

TL;DR

This paper introduces a class of hardware-based cryptographic one-way functions that remain hard to invert even under the assumption that P=NP, leveraging large circuit sizes and runtime.

Contribution

It proposes a novel class of hardware-based one-way functions with security guarantees beyond traditional complexity assumptions.

Findings

Functions are hard to invert even if P=NP

Use of omega(n^2) size circuits and runtime

Potential for practical cryptographic applications

Abstract

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 functions use a hardware-based component with omega(n^2) size circuits, and omega(n^2) run time.