An Efficient Quantum Multi-Collision Search Algorithm

An Efficient Quantum Multi-Collision Search Algorithm

In this article, we propose an efficient quantum k-collision search algorithm with low quantum memory O(n). The previous quantum k-collision algorithms can not be converted into a low quantum memory k-collision algorithm directly, because the time complexity of the converted algorithm is larger than...

Full description

Bibliographic Details
Main Authors: Jian Zou, Yongyang Liu, Le Dong
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Grover's algorithm
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-collision
post-quantum cryptography
symmetric cryptography
Online Access:https://ieeexplore.ieee.org/document/9212378/

Internet

https://ieeexplore.ieee.org/document/9212378/

Similar Items