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
| ||
|
Date: Mon, 15 Sep 2014 13:52:24 -0500 (CDT) From: Steve Thomas <steve@...tu.com> To: discussions@...sword-hashing.net Subject: Re: [PHC] Schvrch is broken > On September 15, 2014 at 1:08 PM Bill Cox <waywardgeek@...hershed.org> wrote: > > > On 09/15/2014 01:05 PM, Steve Thomas wrote: > > > > I guess I should of just posted code in my first message: > > https://github.com/Sc00bz/break-schvrch > > > > This takes about 3 minutes to run. With SSE or AVX it will be > > faster but this is a nice PoC. Note that the generation only needs > > to be done once per m_cost and once for each t_cost when m_cost is > > zero. > > > > Wow, you're good! Really good... You considered *this* code too ugly > to post? Generating the XORs and compiling them totally beats the > speed of what I was going to do (compute them on the fly as matrices). > I see that I need to try and be an even more evil attacker :-) > Thanks and this isn't the ugly code I cleaned it up a bit. This was one file and a lot of commented out code.
Powered by blists - more mailing lists