Paper 2022/948

A quantum polynomial time search algorithm for certain unsorted finite lists

Stephane Lemieux, Macewan University
Abstract

Grover famously showed that any unsorted list, of finite size N, can be searched in O(N) time via quantum computation. Bennett et. al. demonstrated that any algorithm general enough to search any finite unsorted list must take at least O(N) time via quantum computation. We demonstrate a quantum algorithm that can search a proper subclass of finite, unsorted lists, of size N, in a time that is polynomial in log(N). We demonstrate how it can be used to search the keyspace of any block cipher that can be implemented on a quantum computer with the keyspace in superpositon. In particular we give a polynomial time attack on AES128, AES192 and AES256.

Metadata
Available format(s)
-- withdrawn --
Category
Attacks and cryptanalysis
Publication info
Preprint.
Keywords
AES. Quantum Cryptanalysis Quantum Search
Contact author(s)
lemieuxs5 @ macewan ca
History
2022-07-24: withdrawn
2022-07-22: received
See all versions
Short URL
https://ia.cr/2022/948
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.