Second preimages on n-bit hash functions for much less than 2^n work

by John Kelsey , Bruce Schneier
Citations:11 - 2 self

Document Versions

Second preimages on n-bit hash functions for much less than 2^n work –John Kelsey, Bruce Schneier
Second preimages on n-bit hash functions for much less than 2^n work –John Kelsey, Bruce Schneier — 2005 — ADVANCES IN CRYPTOLOGY-EUROCRYPT’2005, VOLUME 3494 OF LECTURE