Exponential Quantum One-Wayness and EFI Pairs

arXiv:2404.13699v1 Announce Type: cross
Abstract: In classical cryptography, one-way functions are widely considered to be the minimal computational assumption. However, when taking quantum information into account, the situation is more nuanced. There are currently two major candidates for the minimal assumption: the search quantum generalization of one-way functions are one-way state generators (OWSG), whereas the decisional variant are EFI pairs. A well-known open problem in quantum cryptography is to understand how these two primitives are related. A recent breakthrough result …

account arxiv candidates computational cryptography cs.cr functions information major quant-ph quantum search state