Quantum Differential Cryptanalysis
classification
🪐 quant-ph
cs.CR
keywords
quantumdifferentialcryptanalysisalgorithmclassicalcountingattackcalling
pith:P4UMBF2A Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{P4UMBF2A}
Prints a linked pith:P4UMBF2A badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.