Quantum differential and linear cryptanalysis

TL;DR: It is established that for all three variants of AES key size 128, 192, and 256i¾źbit that are standardized in FIPS-PUB 197, there are precise bounds for the number of qubits and thenumber of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.

TL;DR: In this paper, it was shown that using whitening keys does not increase the security in the quantum-CPA setting significantly, even in the case of Grover and Simon.

TL;DR: A new quantum algorithm which uses Simon's subroutines in a novel way to leverage the algebraic structure of cryptosystems in the context of a quantum attacker limited to classical queries and offline quantum computations is introduced.

TL;DR: In this paper, it was shown that a quantum mechanical computer can solve integer factorization problem in a finite power of O(log n) time, where n is the number of elements in a given integer.

TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.

TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for both problems, which takes a number of steps polynomial in the input size, e.g., the number of digits to be factored.

TL;DR: In this article, a phone directory containing $N$ names arranged in completely random order is presented, and the desired phone number can be obtained in only O(sqrt{N})$ accesses to the database.