Quantum cryptanalysis of hash and claw-free functions

DOI10.1007/BFb0054319WikidataQ56145031 ScholiaQ56145031MaRDI QIDQ5887414

Peter Høyer, Alain Tapp, Gilles Brassard

Publication date: 12 April 2023

Published in: LATIN'98: Theoretical Informatics (Search for Journal in Brave)

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (58)

On tight quantum security of HMAC and NMAC in the quantum random oracle model ⋮ Quantum collision attacks on reduced SHA-256 and SHA-512 ⋮ The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound ⋮ Low-gate quantum golden collision finding ⋮ On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer ⋮ The quantum search algorithms for all solutions ⋮ Succinct arguments in the quantum random oracle model ⋮ Unnamed Item ⋮ Quantum algorithm for triangle finding in sparse graphs ⋮ Generalized quantum counting algorithm for non-uniform amplitude distribution ⋮ Finding shortest lattice vectors faster using quantum search ⋮ New results on quantum boomerang attacks ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ Improved attacks against reduced-round Whirlwind ⋮ Finding many collisions via reusable quantum walks. Application to lattice sieving ⋮ Triangulating rebound attack on AES-like hashing ⋮ Unitary coined discrete-time quantum walks on directed multigraphs ⋮ Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm ⋮ Quantum impossible differential attacks: applications to AES and SKINNY ⋮ Nostradamus goes quantum ⋮ Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3 ⋮ Quantum time/memory/data tradeoff attacks ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Non-Boolean quantum amplitude amplification and quantum mean estimation ⋮ Quantum solution to a class of two-party private summation problems ⋮ New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions ⋮ Unnamed Item ⋮ On the cost of computing isogenies between supersingular elliptic curves ⋮ A quantum genetic algorithm with quantum crossover and mutation operations ⋮ Quantum algorithm design: techniques and applications ⋮ On the power of non-adaptive learning graphs ⋮ An exact quantum search algorithm with arbitrary database ⋮ Low-communication parallel quantum multi-target preimage search ⋮ Element distinctness revisited ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ Quantum algorithm for the multicollision problem ⋮ Quantum privacy-preserving price E-negotiation ⋮ The quantum query complexity of the determinant ⋮ Unnamed Item ⋮ Strong privacy-preserving two-party scalar product quantum protocol ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing ⋮ Quantum Algorithms for Classical Probability Distributions ⋮ Квантовые атаки на итерационные блочные шифры ⋮ Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli} ⋮ Key establishment à la Merkle in a quantum world ⋮ Claw finding algorithms using quantum walk ⋮ Secure two-party integer comparison protocol without any third party ⋮ Unnamed Item ⋮ A quantum hash function with grouped coarse-grained boson sampling ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions ⋮ On subset-resilient hash function families ⋮ Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms ⋮ He gives C-sieves on the CSIDH

This page was built for publication: Quantum cryptanalysis of hash and claw-free functions