Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
From MaRDI portal
Publication:6566213
DOI10.1007/S11128-024-04424-8zbMATH Open1542.8144MaRDI QIDQ6566213
Publication date: 3 July 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
symmetric cryptosystemsquantum cryptanalysisdistributed exact quantum algorithmsquantum key recovery attacks
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A construction of a cipher from a single pseudorandom permutation.
- Grover meets Simon -- quantumly attacking the FX-construction
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Minimizing the two-round Even-Mansour cipher
- Attacks on beyond-birthday-bound MACs in the quantum setting
- How to build pseudorandom functions from public random permutations
- Quantum attacks on sum of Even-Mansour pseudorandom functions
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Quantum walk and its application domains: a systematic review
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- Quantum circuit implementations of AES with fewer qubits
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Tweaking Even-Mansour Ciphers
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Distributed Bernstein-Vazirani algorithm
- Distributed Grover's algorithm
This page was built for publication: Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566213)
