Searching for "Second Preimages on n-Bit Hash Functions for Much Less than 2n Work." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Second preimages on n-bit hash functions for much less than 2^n work
by John Kelsey, Bruce Schneier
…Second Preimages on n-bit Hash Functions for Much Less than 2 n Work John Kelsey 1 and Bruce…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB