Quantum cryptanalysis of hash and claw-free functions
From MaRDI portal
Cited in
(92)- Claw finding algorithms using quantum walk
- Quantum solution to a class of two-party private summation problems
- On the cost of computing isogenies between supersingular elliptic curves
- Quantum algorithm design: techniques and applications
- 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
- \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli}
- Secure two-party integer comparison protocol without any third party
- 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
- On tight quantum security of HMAC and NMAC in the quantum random oracle model
- Quantum collision attacks on reduced SHA-256 and SHA-512
- On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer
- Succinct arguments in the quantum random oracle model
- Strong privacy-preserving two-party scalar product quantum protocol
- Key establishment à la Merkle in a quantum world
- Generalized quantum counting algorithm for non-uniform amplitude distribution
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
- A quantum genetic algorithm with quantum crossover and mutation operations
- New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Quantum attacks against iterated block ciphers
- The quantum search algorithms for all solutions
- On the power of non-adaptive learning graphs
- An exact quantum search algorithm with arbitrary database
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
- Quantum Algorithms for Classical Probability Distributions
- Quantum lower bounds for approximate counting via Laurent polynomials
- Analyzing the reliability of quantum amplitude amplification techniques in the presence of noise
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- Improved output-sensitive quantum algorithms for Boolean matrix multiplication
- 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
- scientific article; zbMATH DE number 7716601 (Why is no real title available?)
- Non-Boolean quantum amplitude amplification and quantum mean estimation
- Quantum Key Recovery Attacks on 3-Round Feistel-2 Structure Without Quantum Encryption Oracles
- Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
- Multidimensional quantum walks
- Quantum algorithm for finding impossible differentials and zero-correlation linear hulls of symmetric ciphers
- Quantum secure clockwise sorting
- Quantum attacks on hash constructions with low quantum random access memory
- Quantum speed-up for multidimensional (zero correlation) linear distinguishers
- SDitH in the QROM
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Quantum boomerang attacks and some applications
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- The NISQ complexity of collision finding
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Improving generic attacks using exceptional functions
- Post-quantum security of key-alternating Feistel ciphers
- Understanding the thermodynamics of computation: a pedagogical overview
- Quantum lower bounds by sample-to-query lifting
- (Multi-key) quantum analysis of masked Even-Mansour with applications to offset public permutation and Elephant
- On the fine-grained query complexity of symmetric functions
- Quantum algorithms for fast correlation attacks on LFSR-based stream ciphers
- Reducing the number of qubits in solving LWE
- Using quantum switches to mitigate noise in Grover's search algorithm
- On the fine-grained query complexity of symmetric functions
- Quantum security of Trojan message attacks on Merkle-Damgård hash construction
- Multidimensional quantum walks, with application to k-distinctness
- Quantum time-space tradeoff for finding multiple collision pairs
- Quantum security of the Legendre PRF
- Quantum money from quaternion algebras
- The order of hashing in Fiat-Shamir schemes
- DGSP: an efficient scalable fully dynamic group signature scheme using \text{SPHINCS}\textsuperscript{+}
- A collision attack on the LTZ hash function based on a conjecture on supersingular non-superspecial isogeny graphs of dimension 2
- Block cipher doubling for a post-quantum world
- Optimizing c-sum BKW and faster quantum variant for LWE
- Quantum property testing in sparse directed graphs
- HHGS: forward-secure dynamic group signatures from symmetric primitives
- Low-gate quantum golden collision finding
- Finding shortest lattice vectors faster using quantum search
- The quantum query complexity of the determinant
This page was built for publication: Quantum cryptanalysis of hash and claw-free functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887414)
