Re: Validation flaw addressed in version 2.14
Jeff Gilchrist <[email protected]>
| Newsgroups | gmane.comp.security.passwordsafe.devel |
|---|---|
| Message-ID | <[email protected]> |
On 11/25/05, Rony Shapiro <[email protected]> wrote: > Thanks for sharing the benchmark numbers. Indeed it would seem that 1000 > SHA-1 iterations is not much of a speed bump nowadays. Here are the results using SHA-256 (Brian Gladman's code http://fp.gladman.plus.com/cryptography_technology/sha/index.htm). Still not much of a problem for 32bit CPUs. With Brian's code, the P3 is outperforming or on par with a P4 that is almost twice its speed. Like I was saying before, having the # of iterations configurable would allow people to set the best number for their system and needs. **** Pentium3 866 MHz **** Benchmarking 1000 SHA-256 hash iterations... Wall Clock: 0.003600 seconds Benchmarking 10000 SHA-256 hash iterations... Wall Clock: 0.036487 seconds Benchmarking 100000 SHA-256 hash iterations... Wall Clock: 0.363381 seconds **** Pentium4 1.4 GHz **** Benchmarking 1000 SHA-256 hash iterations... Wall Clock: 0.033000 seconds Benchmarking 10000 SHA-256 hash iterations... Wall Clock: 0.049000 seconds Benchmarking 100000 SHA-256 hash iterations... Wall Clock: 0.349000 seconds **** Pentium4 3.0 GHz **** Benchmarking 1000 SHA-256 hash iterations... Wall Clock: 0.001226 seconds Benchmarking 10000 SHA-256 hash iterations... Wall Clock: 0.011639 seconds Benchmarking 100000 SHA-256 hash iterations... Wall Clock: 0.115646 seconds Jeff. ------------------------------------------------------- This SF.net email is sponsored by: Splunk Inc. Do you grep through log files for problems? Stop! Download the new AJAX search engine that makes searching your log files as easy as surfing the web. DOWNLOAD SPLUNK! http://ads.osdn.com/?ad_idv37&alloc_id865&op=click