Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
An algorithmic framework for the generalized birthday problem
Itai Dinur
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
14
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An algorithmic framework for the generalized birthday problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Algorithm Framework
100%
Generalized Birthday Problem
100%
Time Complexity
50%
Memory Complexity
50%
Time-memory Trade-off
50%
Trade-off Curve
50%
Shamir
25%
Algorithmic Approach
25%
Kd-tree
25%
Cryptanalysis
25%
Knapsack Problem
25%
Problem Instances
25%
Powers of 2
25%
Tree Algorithm
25%
Graham
25%
Computer Science
Knapsack Problem
100%
Problem Instance
100%
Cryptanalysis
100%
Tree Algorithm
100%
K-Trees
100%
Mathematics
Integer
100%
Cryptanalysis
100%