Creating quantum-resistant classical-classical OWFs from quantum-classical OWFs

09/21/2022
by   Wei Zheng Teo, et al.
0

One-way functions (OWF) are one of the most essential cryptographic primitives, the existence of which results in wide-ranging ramifications such as private-key encryption and proving P ≠ NP. These OWFs are often thought of as having classical input and output (i.e. binary strings), however, recent work proposes OWF constructions where the input and/or the output can be quantum. In this paper, we demonstrate that quantum-classical (i.e. quantum input, classical output) OWFs can be used to produce classical-classical (i.e. classical input, classical output) OWFs that retain the one-wayness property against any quantum polynomial adversary (i.e. quantum-resistant). We demonstrate this in two ways. Firstly, we propose a definition of quantum-classical OWFs and show that the existence of such a quantum-classical OWF would imply the existence of a classical-classical OWF. Secondly, we take a proposed quantum-classical OWF and demonstrate how to turn it into a classical-classical OWF. In summary, this paper showcases another possible route into proving the existence of classical-classical OWFs (assuming intermediate quantum computations are allowed) using a "domain-shifting" technique between classical and quantum information, with the added bonus that such OWFs are also going to be quantum-resistant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2023

Quantum trapdoor functions from classical one-way functions

We introduce the notion of a quantum trapdoor function. This is an effic...
research
06/23/2022

Classical surrogates for quantum learning models

The advent of noisy intermediate-scale quantum computers has put the sea...
research
01/07/2019

Learning Nonlinear Input-Output Maps with Dissipative Quantum Systems

In this paper, we develop a theory of learning nonlinear input-output ma...
research
04/03/2019

On the classical complexity of quantum interference of indistinguishable bosons

The classical complexity of sampling from the probability distribution o...
research
07/20/2023

Quantum Logspace Computations are Verifiable

In this note, we observe that quantum logspace computations are verifiab...
research
09/23/2017

Classical and Quantum Factors of Channels

Given a classical channel, a stochastic map from inputs to outputs, can ...
research
02/27/2020

Quantum Attacks without Superposition Queries: the Offline Simon's Algorithm

In symmetric cryptanalysis, the model of superposition queries has led t...

Please sign up or login with your details

Forgot password? Click here to reset