[Cryptography] Creating a Parallelizeable Cryptographic Hash Function

Tom Mitchell mitch at niftyegg.com
Mon Oct 6 08:09:37 EDT 2014

On Sat, Oct 4, 2014 at 5:11 PM, Christian Huitema <huitema at huitema.net>

> > To a programmer a good hash table is not the same as a good crypto hash.

> Actually, it is a bit more complex than that. In many applications, you
> have to be concerned about denial of service attacks. If an outsider can
> manufacture hash collisions, then you can end up with a serious issue, the
> hash resolution moving for example from O(1) to O(N). Think for example of
> a hash table going from TCP headers to TCP context, and a SYN attack
> amplifying the damage by picking combinations of address and ports that
> result in hash collisions.

Absolutely....  it is clearly necessary to understand how data can be
messed with
and more to the point that it can or cannot be messed with.

It gets interesting when an application fully in control of data in and out
is modified
and opened to the world in a more general case.   The initial assumptions
are now
invalidated and the new context needs to be reconsidered.   The impact is
less obvious than one might hope (and could make your heart bleed).

  T o m    M i t c h e l l
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20141006/14141d00/attachment.html>

More information about the cryptography mailing list