Quantum attacks on hash constructions with low quantum random access memory
From MaRDI portal
Publication:6595804
Cites work
- Advances in Cryptology – CRYPTO 2004
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Breaking symmetric cryptosystems using quantum period finding
- Constructing an Ideal Hash Function from Weak Ideal Compression Functions
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- Finding Collisions in the Full SHA-1
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Functional graph revisited: updates on (second) preimage attacks on hash combiners
- Generic attacks on hash combiners
- Grover meets Simon -- quantumly attacking the FX-construction
- Herding Hash Functions and the Nostradamus Attack
- Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
- Hidden shift quantum cryptanalysis and implications
- How to Break MD5 and Other Hash Functions
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Low-communication parallel quantum multi-target preimage search
- Low-gate quantum golden collision finding
- MD5 is weaker than weak: attacks on concatenated combiners
- New attacks on the concatenation and XOR hash combiners
- New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions
- New second-preimage attacks on hash functions
- Nostradamus goes quantum
- On diamond structures and Trojan message attacks
- On quantum slide attacks
- On the complexity of the herding attack and some related attacks on hash functions
- On the Power of Quantum Computation
- Optimal merging in quantum k-xor and k-sum algorithms
- Quantum algorithms for the \(k\)-XOR problem
- Quantum attacks on some Feistel block ciphers
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum chosen-ciphertext attacks against Feistel ciphers
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Quantum collision attacks on reduced SHA-256 and SHA-512
- Quantum cryptanalysis of hash and claw-free functions
- Quantum linear key-recovery attacks using the QFT
- Quantum linearization attacks
- Quantum random access memory
- Quantum Walk Algorithm for Element Distinctness
- Second Preimage Attacks on Dithered Hash Functions
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Simplified MITM modeling for permutations: new (quantum) attacks
- The first collision for full SHA-1
- The sum can be weaker than each part
- Triangulating rebound attack on AES-like hashing
Cited in
(2)
This page was built for publication: Quantum attacks on hash constructions with low quantum random access memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595804)
