phc-discussions - Re: [PHC] winner selection

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

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Date: Fri, 17 Apr 2015 20:03:29 +0100
From: Samuel Neves <sneves@....uc.pt>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] winner selection

On 04/17/2015 02:48 PM, Thomas Pornin wrote:
> One important point to check about the second article is whether it
> talks about generic 2048-bit modular exponentiations, or about 2048-bit
> RSA -- because the latter case implies a 4x speedup (thanks to the CRT).

The results in [2] are relative to raw 2048-bit exponentiation. [3] does RSA-2048 decryption instead, hence why I
referred to 1024-bit modular arithmetic.