| 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: <CA+hr98HusmteMzz4MXZqnAwn4k8Bbno2ta-Qh_=jvmuUsapYig@mail.gmail.com>
Date: Wed, 25 Jun 2014 13:17:50 +0200
From: Krisztián Pintér <pinterkr@...il.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: Re: [PHC] Re: TwoCats multiplication chain
On Wed, Jun 25, 2014 at 1:05 PM, Thomas Pornin <pornin@...et.org> wrote:
>
> Since, for password hashing, we want code which is faster on a PC than
> on a FPGA, we should build up on operations that work best on a PC and
> worst on a FPGA. From this point of view, using CLMUL looks like a
> not-so-good idea.
>
it also means that you recommend multiplication? what about integer
division?
Content of type "text/html" skipped
Powered by blists - more mailing lists