Finding Preimages in Full MD5 Faster Than Exhaustive Search (Q3627432)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5552773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Preimages in Full MD5 Faster Than Exhaustive Search |
scientific article; zbMATH DE number 5552773 |
Statements
Finding Preimages in Full MD5 Faster Than Exhaustive Search (English)
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
0.77969193
0 references
0.76701665
0 references
0.76413035
0 references
0 references
0 references
