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  PHC 
Open Source and information security mailing list archives
Hash Suite for Android: free password hash cracker in your pocket
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Wed, 2 Apr 2014 20:29:07 -0400
From: Bill Cox <>
Subject: Re: [PHC] data-dependent branching (Re: [PHC] A little nit which
 bothers me...)

Data dependent branching doesn't seem to buy as much ASIC resistance
as some PHC submitters seem to think, IMO.  In an ASIC or FPGA, the
if-then-else statements synthesize to muxes in hardware, and then the
optimizer gets to reuse blocks that are in mutually exclusive block
statements.  For example, if there are four functions that have 32-bit
multiplies, the optimizer will put 4-to-1 muxes in front of it's
inputs, and reuse the multiplier for all 4 functions.  On the other
hand, there's not much that can be done to optimize data dependent


Powered by blists - more mailing lists