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

by John Kelsey , Bruce Schneier
Citations:15 - 3 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 2n Work –John Kelsey, Bruce Schneier — 2005 — Eurocrypt 2005. Volume 3494 of Lecture Notes in Computer Science
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