8 Dec
2014
8 Dec
'14
6:47 p.m.
Naturally even a 2^64 collision attack requires implausible amounts of storage, so properly designed hash functions should be secure for the indefinite future. That'd only be the case for a naive collision finding attack. But
On Mon, Dec 8, 2014 at 11:40 AM, Ryan Carboni <ryacko@gmail.com> wrote: there are attacks that require little memory. Search for "distinguished points".