Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems (Q2914297): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_42 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2252401345 / rank
 
Normal rank

Latest revision as of 22:18, 19 March 2024

scientific article
Language Label Description Also known as
English
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
scientific article

    Statements

    Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2012
    0 references
    0 references
    cryptanalysis
    0 references
    TM-tradeoff
    0 references
    multi-encryption
    0 references
    knapsacks
    0 references
    bicomposite
    0 references
    dissection
    0 references
    rebound
    0 references
    0 references