Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s00145-018-9303-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2888583758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved key recovery attacks on reduced-round AES with practical data and memory complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Generic Algorithms for Hard Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keying Hash Functions for Message Authentication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of triple modes of operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieve-in-the-Middle: Improved MITM Attacks / 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: New Attacks on Feistel Structures with Improved Memory Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Attacks on Full GOST / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Cascade Ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cryptanalytic time-memory trade-off / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Generic Algorithms for Hard Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Single-Key Attack on the Full GOST Block Cipher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of Full Sprout / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rebound attack and subspace distinguishers: application to Whirlpool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving space by algebraization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attacking Triple Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Improve Rebound Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude / 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: Space-Efficient Randomized Algorithms for K-SUM / rank
 
Normal rank

Latest revision as of 03:49, 21 July 2024

scientific article
Language Label Description Also known as
English
Efficient dissection of bicomposite problems with cryptanalytic applications
scientific article

    Statements

    Efficient dissection of bicomposite problems with cryptanalytic applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2019
    0 references
    0 references
    bicomposite problems
    0 references
    dissection algorithm
    0 references
    time-memory tradeoff
    0 references
    cryptanalysis
    0 references
    multiple encryption
    0 references
    knapsack problems
    0 references
    0 references
    0 references