[136689] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: the skein hash function

daemon@ATHENA.MIT.EDU (Peter Gutmann)
Sat Nov 1 19:15:45 2008

From: pgut001@cs.auckland.ac.nz (Peter Gutmann)
To: bill.stewart@pobox.com, cryptography@metzdowd.com
In-Reply-To: <6.2.1.2.1.20081029230844.046e4910@pop.sonic.net>
Date: Fri, 31 Oct 2008 21:25:37 +1300

Bill Stewart <bill.stewart@pobox.com> writes:

>A quick google-look at ASICs showed a number in the range of 300K-20M gates,
>so hash-trees could probably get speedups of up to 20-100x if you can keep
>from becoming input-speed-bound. The 300K chips were about $6, 5M at $50 and
>350MHz, which is somewhat faster than the Skein team estimate, and some of
>the denser chips didn't mention price but were starting to use 45nm
>technology.

I don't know about ASICs but for FPGAs you can pay in the thousands of dollars
for a single high-end device (forget Xeons, that's the market to be in), so
you don't want to set your sights too high.  My guess is they were designing
down to a price rather than up to a performance figure.

Peter.

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com

home help back first fref pref prev next nref lref last post