Quantum linear key-recovery attacks using the QFT
From MaRDI portal
Publication:6190139
DOI10.1007/978-3-031-38554-4_9OpenAlexW4385654257MaRDI QIDQ6190139
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38554-4_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
- Multidimensional linear distinguishing attacks and Boolean functions
- On quantum slide attacks
- \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations
- Improvements to quantum search techniques for block-ciphers, with applications to AES
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Post-quantum security of the Even-Mansour cipher
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Linear hulls with correlation zero and linear cryptanalysis of block ciphers
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Quantum Algorithms for Some Hidden Shift Problems
- Rapid solution of problems by quantum computation
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Estimating the Probabilities of Low-Weight Differential and Linear Approximations on PRESENT-Like Ciphers
- Advances in Cryptology – CRYPTO 2004
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Probability distributions of correlation and differentials in block ciphers
- Quantum rejection sampling
- Clustering effect in \textsc{Simon} and \textsc{Simeck}
- Generic framework for key-guessing improvements
- Optimising linear key recovery attacks with affine Walsh transform pruning
This page was built for publication: Quantum linear key-recovery attacks using the QFT
