A novel algorithm for the k-XOR problem

DOI10.1007/S10623-025-01667-ZMaRDI QIDQ6918211zbMATH OpenFDO

Authors Yong Liu, Zejun Xiang, Xiangyong Zeng, Shasha Zhang

Publication date 10 October 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-025-01667-Z

zbMATH Keywords

k-XOR problemparity check problemtime-memory tradeoff

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Cryptography (94A60)

Cites work

• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• An algorithmic framework for the generalized birthday problem
• Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
• FSBday
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• Improved Generic Algorithms for Hard Knapsacks
• Improved quantum algorithms for the k-XOR problem
• New generic algorithms for hard knapsacks
• Optimal merging in quantum k-xor and k-sum algorithms
• Parallel collision search with cryptanalytic applications
• Quantum algorithms for the \(k\)-XOR problem
• Refinements of the k-tree Algorithm for the Generalized Birthday Problem
• The extended \(k\)-tree algorithm

This page was built for publication: A novel algorithm for the \(k\)-XOR problem

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