DeepAI AI Chat
Log In Sign Up

Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis

by   Panjin Kim, et al.

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-offs curves in terms of depth and qubit. The method guides how to 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.


page 1

page 2

page 3

page 4


An Optimized Quantum Implementation of ISD on Scalable Quantum Resources

The security of code based constructions is usually assessed by Informat...

Tight Quantum Time-Space Tradeoffs for Function Inversion

In function inversion, we are given a function f: [N] ↦ [N], and want to...

Open Problems Related to Quantum Query Complexity

I offer a case that quantum query complexity still has loads of enticing...

Learned Sorted Table Search and Static Indexes in Small Model Space

Machine Learning Techniques, properly combined with Data Structures, hav...

Real Differences between OT and CRDT in Correctness and Complexity for Consistency Maintenance in Co-Editors

OT (Operational Transformation) was invented for supporting real-time co...

ACSS-q: Algorithmic complexity for short strings via quantum accelerated approach

In this research we present a quantum circuit for estimating algorithmic...

A Location-Based Global Authorization Method for Underwater Security

National or international maritime authorities are used to handle reques...