Cryptology ePrint Archive: Report 2018/452

Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2

Panjin Kim and Daewan Han and Kyung Chul Jeong

Abstract: Performance of cryptanalytic quantum search algorithms is mainly inferred from query complexity which hides overhead induced by an implementation. To shed light on quantitative complexity analysis removing hidden factors, we provide a framework for estimating time-space complexity, with carefully accounting for characteristics of target cryptographic functions. Processor and circuit parallelization methods are taken into account, resulting in the time-space trade-off curves in terms of depth and qubit. The method guides howto rank different circuit designs in order of their efficiency. The framework is applied to representative cryptosystems NIST referred to as a guideline for security parameters, reassessing the security strengths of AES and SHA-2.

Category / Keywords: Quantum circuit, Grover, Parallelization, Resource estimates, AES, SHA-2

Original Publication (in the same form): Quantum Information Processing
DOI:
10.1007/s11128-018-2107-3

Date: received 14 May 2018, last revised 31 Oct 2018

Contact author: jeongkc at nsr re kr

Available format(s): PDF | BibTeX Citation

Version: 20181101:035525 (All versions of this report)

Short URL: ia.cr/2018/452


[ Cryptology ePrint archive ]