Finding Preimages in Full MD5 Faster Than Exhaustive Search (Q3627432): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Preimage Attacks on One-Block MD4, 63-Step MD5 and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preimages for Reduced SHA-0 and SHA-1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversion Attacks on Secure Hash Functions Using sat Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: MD4 is Not One-Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preimage Attacks on Step-Reduced MD5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preimage Attacks on 3, 4, and 5-Pass HAVAL / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Break MD5 and Other Hash Functions / rank
 
Normal rank

Latest revision as of 13:09, 1 July 2024

scientific article
Language Label Description Also known as
English
Finding Preimages in Full MD5 Faster Than Exhaustive Search
scientific article

    Statements

    Finding Preimages in Full MD5 Faster Than Exhaustive Search (English)
    0 references
    0 references
    0 references
    12 May 2009
    0 references
    MD5
    0 references
    splice-and-cut
    0 references
    local collision
    0 references
    hash function
    0 references
    one-way
    0 references
    preimage
    0 references

    Identifiers