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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-018-00594-6 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q122687145 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-018-00594-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2899970174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Generic Algorithms for Hard Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSBday / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Bounds for the Design of Code-Based Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Generic Algorithms for Hard Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast correlation attacks on certain stream ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extended \(k\)-tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements of the k-tree Algorithm for the Generalized Birthday Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel collision search with cryptanalytic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409125 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-018-00594-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:28, 16 December 2024

scientific article
Language Label Description Also known as
English
An algorithmic framework for the generalized birthday problem
scientific article

    Statements

    Identifiers