Quantum query lower bounds for key recovery attacks on the Even-Mansour cipher

DOI10.1007/978-3-031-49193-1_1MaRDI QIDQ6591613

Yūki Naito, Akinori Kawachi

Publication date: 22 August 2024

zbMATH Keywords

lower boundsquantum computingquery complexitysymmetric-key cryptography

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• A construction of a cipher from a single pseudorandom permutation.
• Post-quantum security of the Even-Mansour cipher
• How to build pseudorandom functions from public random permutations
• Quantum attacks without superposition queries: the offline Simon's algorithm
• Quantum attacks on sum of Even-Mansour pseudorandom functions
• How to record quantum queries, and applications to quantum indifferentiability
• The quantum query complexity of the abelian hidden subgroup problem
• Breaking Symmetric Cryptosystems Using Quantum Period Finding
• Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
• Limitations of the Even-Mansour construction
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Tight Security Bounds for Key-Alternating Ciphers
• Quantum lower bounds by polynomials

This page was built for publication: Quantum query lower bounds for key recovery attacks on the Even-Mansour cipher

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591613)