The extended \(k\)-tree algorithm

DOI10.1007/s00145-011-9097-yzbMath1271.68241OpenAlexW2004781696MaRDI QIDQ431783

Alistair Sinclair, Lorenz Minder

Publication date: 3 July 2012

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-011-9097-y

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (13)

Quantum algorithms for the \(k\)-XOR problem ⋮ Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Asymptotic results for the number of Wagner's solutions to a generalised birthday problem ⋮ The extended \(k\)-tree algorithm ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Really Fast Syndrome-Based Hashing ⋮ An algorithmic framework for the generalized birthday problem ⋮ Statistical Decoding of Codes over $\mathbb{F}_q$ ⋮ Constructing Carmichael numbers through improved subset-product algorithms ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms

Uses Software

• SWIFFT

Cites Work

• The extended \(k\)-tree algorithm
• SWIFFT: A Modest Proposal for FFT Hashing
• FSBday
• The Knapsack Hash Function proposed at Crypto’89 can be broken
• A sieve algorithm for the shortest lattice vector problem
• An Improved Multi-set Algorithm for the Dense Subset Sum Problem
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Progress in Cryptology – Mycrypt 2005
• Noise-tolerant learning, the parity problem, and the statistical query model
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The extended \(k\)-tree algorithm