lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
Open Source and information security mailing list archives
| ||
|
Message-ID: <CAOLP8p40yhCcgKUrRDFYV4C-_-Ga4mX=YJVVR_ztrGzuqo-4mA@mail.gmail.com>
Date: Sat, 5 Sep 2015 23:57:40 -0700
From: Bill Cox <waywardgeek@...il.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: Re: [PHC] Where do authors get these numbers?
Hi, Samuel. I have not thanked you yet for those links to the original
work on elliptic curves and Edward's paper. Those were awesome, and took
me a couple weeks to get through. I still do not understand the manifold
stuff in Edward's paper, but I understand most of it.
I am pretty sure TwoCats is the fastest entry in the competition for
single-thread hashing, which is refuted in this paper. It's not a matter
of which CPU or mode of measuring speed. There might be some special case
where this is not true, but I have not found any. Maybe they ran in debug
mode or some such thing, which is probable if they checked out my current
branch. I check in a lot of errors like that.
Actually, EARWORM beat my hashing speed. It was the fastest in the
competition. That is an awesome algorithm. I wish he'd entered a modified
version with stronger distributed-ROM defense. With the AES-NI based
hashing, he would easily win the speed contest, though with the restriction
of requiring special instructions in the CPU.
Bill
Content of type "text/html" skipped
Powered by blists - more mailing lists