An algorithmic framework for the generalized birthday problem (Q1999907): Difference between revisions

@@ Property / cites work @@
+Improved Generic Algorithms for Hard Knapsacks
@@ Property / cites work: Improved Generic Algorithms for Hard Knapsacks / rank @@
+Normal rank
@@ Property / cites work @@
+Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
+Normal rank
@@ Property / cites work @@
+FSBday
@@ Property / cites work: FSBday / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374940
@@ Property / cites work: Q3374940 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
+Normal rank
@@ Property / cites work @@
+Security Bounds for the Design of Code-Based Cryptosystems
+Normal rank
@@ Property / cites work @@
+New Generic Algorithms for Hard Knapsacks
@@ Property / cites work: New Generic Algorithms for Hard Knapsacks / rank @@
+Normal rank
@@ Property / cites work @@
+Fast correlation attacks on certain stream ciphers
+Normal rank
@@ Property / cites work @@
+The extended \(k\)-tree algorithm
@@ Property / cites work: The extended \(k\)-tree algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Refinements of the k-tree Algorithm for the Generalized Birthday Problem
+Normal rank
@@ Property / cites work @@
+A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
+Normal rank
@@ Property / cites work @@
+Parallel collision search with cryptanalytic applications
+Normal rank
@@ Property / cites work @@
+Q4409125
@@ Property / cites work: Q4409125 / rank @@
+Normal rank