The Security of Hardware-Based Omega(n^2) Cryptographic One-Way Functions: Beyond Satisfiability and P=NP
Computational Complexity
2016-10-25 v1 Cryptography and Security
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.
Keywords
Cite
@article{arxiv.1610.07190,
title = {The Security of Hardware-Based Omega(n^2) Cryptographic One-Way Functions: Beyond Satisfiability and P=NP},
author = {Javier A. Arroyo-Figueroa},
journal= {arXiv preprint arXiv:1610.07190},
year = {2016}
}