Quantum Differential Cryptanalysis

11/25/2018
by   Qing Zhou, et al.
0

In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it. The quantum differential cryptanalysis is based on the quantum minimum/maximum-finding algorithm, where the values to be compared and filtered are obtained by calling the quantum counting algorithm. Any cipher which is vulnerable to the classical differential cryptanalysis based on counting procedures can be cracked more quickly under this quantum differential attack.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2023

A Differential Datalog Interpreter

Redacted by arXiv admins...
research
02/16/2023

QTrojan: A Circuit Backdoor Against Quantum Neural Networks

We propose a circuit-level backdoor attack, QTrojan, against Quantum Neu...
research
12/18/2017

Quantum impossible differential and truncated differential cryptanalysis

We study applications of BV algorithm and present quantum versions of im...
research
10/22/2019

Quantum Weighted Model Counting

In Weighted Model Counting (WMC) we assign weights to Boolean literals a...
research
03/26/2020

Robust quantum minimum finding with an application to hypothesis selection

We consider the problem of finding the minimum element in a list of leng...
research
01/12/2023

Quantum algorithm for finding minimum values in a Quantum Random Access Memory

Finding the minimum value in an unordered database is a common and funda...
research
08/10/2022

Improved Quantum Supersampling for Quantum Ray Tracing

Ray tracing algorithm is a category of rendering algorithms that calcula...

Please sign up or login with your details

Forgot password? Click here to reset