An algorithmic framework for the generalized birthday problem
type: Item
instance of: scholarly article
title: An algorithmic framework for the generalized birthday problem
zbMATH Open document ID: 1409.94868
author: Itai Dinur
published in: Designs, Codes and Cryptography
publication date: 2019-06-27T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7074426
zbMATH Keywords: cryptanalysis
zbMATH Keywords: time-memory tradeoff
zbMATH Keywords: generalized birthday problem
zbMATH Keywords: K-tree algorithm
Wikidata QID: Q122687145
MaRDI profile type: Publication
full work available at URL: s10623-018-00594-6
OpenAlex ID: W2899970174
cites work: Improved Generic Algorithms for Hard Knapsacks
cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
cites work: FSBday
cites work: Q3374940
cites work: Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
cites work: Security Bounds for the Design of Code-Based Cryptosystems
cites work: New Generic Algorithms for Hard Knapsacks
cites work: Fast correlation attacks on certain stream ciphers
cites work: The extended \(k\)-tree algorithm
cites work: Refinements of the k-tree Algorithm for the Generalized Birthday Problem
cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
cites work: Parallel collision search with cryptanalytic applications
cites work: Q4409125
DOI: 10.1007/S10623-018-00594-6
description: scientific article; zbMATH DE number 7074426