Quantum algorithms for the \(k\)-XOR problem
type: Item
instance of: scholarly article
title: Quantum algorithms for the \(k\)-XOR problem
zbMATH Open document ID: 1446.94132
DOI: 10.1007/978-3-030-03326-2_18
author: Lorenzo Grassi
author: María Naya-Plasencia
author: André Schrottenloher
publication date: 2018-12-20T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q12
zbMATH DE Number: 6996130
zbMATH Keywords: quantum algorithms
zbMATH Keywords: generalized Birthday problem
zbMATH Keywords: quantum cryptanalysis
zbMATH Keywords: \(3\)-XOR
zbMATH Keywords: \(k\)-XOR
zbMATH Keywords: List-merging algorithms
zbMATH Keywords: amplitude amplification
MaRDI profile type: Publication
full work available at URL: 978-3-030-03326-2 18
OpenAlex ID: W2898287204
cites work: New Proofs for NMAC and HMAC: Security Without Collision-Resistance
cites work: Q3210163
cites work: From Non-adaptive to Adaptive Pseudorandom Functions
cites work: Hardness Preserving Reductions via Cuckoo Hashing
cites work: On the Impossibility of Tight Cryptographic Reductions
cites work: Key Homomorphic PRFs and Their Applications
cites work: New and Improved Key-Homomorphic Pseudorandom Functions
cites work: Pseudorandom Functions and Lattices
cites work: Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
cites work: Q4737250
cites work: Universal classes of hash functions
cites work: Fully, (Almost) Tightly Secure IBE and Dual System Groups
cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem
cites work: Efficient Pseudorandom Functions via On-the-Fly Adaptation
cites work: An Algebraic Framework for Diffie-Hellman Assumptions
cites work: An algebraic framework for Diffie-Hellman assumptions
cites work: On the Cryptographic Applications of Random Functions (Extended Abstract)
cites work: Q3729902
cites work: Tightly CCA-Secure Encryption Without Pairings
cites work: Foundations of Cryptography
cites work: Waters Signatures with Optimal Security Reduction
cites work: Q3549728
cites work: Hardness Preserving Constructions of Pseudorandom Functions
cites work: Optimal Security Proofs for Full Domain Hash, Revisited
cites work: Cryptographic Extraction and Key Derivation: The HKDF Scheme
cites work: One way functions and pseudorandom generators
cites work: Why Proving HIBE Systems Secure Is Difficult
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Breaking Symmetric Cryptosystems Using Quantum Period Finding
cites work: Grover meets Simon -- quantumly attacking the FX-construction
cites work: Quantum algorithms via linear algebra. A primer
cites work: Search via Quantum Walk
cites work: Quantum Computer Science
cites work: The extended \(k\)-tree algorithm
cites work: XLS is Not a Strong Pseudorandom Permutation
cites work: How to Improve Rebound Attacks
cites work: Refinements of the k-tree Algorithm for the Generalized Birthday Problem
cites work: How to Enrich the Message Space of a Cipher
cites work: Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
cites work: On the Power of Quantum Computation
cites work: Q4409125
description: scientific article; zbMATH DE number 6996130