Refinements of the k-tree Algorithm for the Generalized Birthday Problem

DOI10.1007/978-3-662-48800-3_28zbMath1382.94147OpenAlexW2292398597MaRDI QIDQ2795995

Yu Sasaki, Ivica Nikolić

Publication date: 23 March 2016

Published in: Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48800-3_28

zbMATH Keywords

generalized birthday problemtime-memory tradeoff\(k\)-List problem\(k\)-tree algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Quantum algorithms for the \(k\)-XOR problem ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ On the security of ECDSA with additive key derivation and presignatures ⋮ Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2 ⋮ Efficient and extensive search for precise linear approximations with high correlations of full SNOW-V ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ A New Algorithm for the Unbalanced Meet-in-the-Middle Problem ⋮ An algorithmic framework for the generalized birthday problem ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms

This page was built for publication: Refinements of the k-tree Algorithm for the Generalized Birthday Problem