Quantum search for scaled hash function preimages
From MaRDI portal
Publication:2690252
DOI10.1007/s11128-021-03118-9OpenAlexW3091747039MaRDI QIDQ2690252
Sergi Ramos-Calderer, Victor Mateu, Marc Manzano, José I. Latorre, Emanuele Bellini
Publication date: 15 March 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.00621
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The hash function \texttt{BLAKE}
- On quantum slide attacks
- Improvements to quantum search techniques for block-ciphers, with applications to AES
- Quantum reversible circuit of AES-128
- Grover meets Simon -- quantumly attacking the FX-construction
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Low-communication parallel quantum multi-target preimage search
- Quantum key-recovery on full AEZ
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- SPHINCS: Practical Stateless Hash-Based Signatures
- Квантовые атаки на итерационные блочные шифры
- A SIMPLIFIED AES ALGORITHM AND ITS LINEAR AND DIFFERENTIAL CRYPTANALYSES
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
This page was built for publication: Quantum search for scaled hash function preimages