Quantum algorithms for the \(k\)-XOR problem
From MaRDI portal
Publication:1633472
DOI10.1007/978-3-030-03326-2_18zbMath1446.94132OpenAlexW2898287204MaRDI QIDQ1633472
Lorenzo Grassi, André Schrottenloher, María Naya-Plasencia
Publication date: 20 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_18
quantum algorithmsamplitude amplificationquantum cryptanalysis\(3\)-XOR\(k\)-XORgeneralized Birthday problemList-merging algorithms
Related Items (8)
Triangulating rebound attack on AES-like hashing ⋮ Quantum time/memory/data tradeoff attacks ⋮ Quantum attacks against BBB secure PRFs or MACs built from public random permutations ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ Some efficient quantum circuit implementations of Camellia ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The extended \(k\)-tree algorithm
- An algebraic framework for Diffie-Hellman assumptions
- One way functions and pseudorandom generators
- Universal classes of hash functions
- Grover meets Simon -- quantumly attacking the FX-construction
- Refinements of the k-tree Algorithm for the Generalized Birthday Problem
- Tightly CCA-Secure Encryption Without Pairings
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Key Homomorphic PRFs and Their Applications
- An Algebraic Framework for Diffie-Hellman Assumptions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- New and Improved Key-Homomorphic Pseudorandom Functions
- From Non-adaptive to Adaptive Pseudorandom Functions
- Hardness Preserving Constructions of Pseudorandom Functions
- Optimal Security Proofs for Full Domain Hash, Revisited
- Pseudorandom Functions and Lattices
- Waters Signatures with Optimal Security Reduction
- XLS is Not a Strong Pseudorandom Permutation
- Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Search via Quantum Walk
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Efficient Pseudorandom Functions via On-the-Fly Adaptation
- How to Enrich the Message Space of a Cipher
- Cryptographic Extraction and Key Derivation: The HKDF Scheme
- Foundations of Cryptography
- A Reliable Randomized Algorithm for the Closest-Pair Problem
- On the Power of Quantum Computation
- Hardness Preserving Reductions via Cuckoo Hashing
- How to Improve Rebound Attacks
- Quantum Computer Science
- Why Proving HIBE Systems Secure Is Difficult
- On the Impossibility of Tight Cryptographic Reductions
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Quantum algorithms for the \(k\)-XOR problem
