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, 7 Aug 2013 08:40:22 +0000
From: Marsh Ray <>
To: "" <>
Subject: RE: [PHC] A (naively?) simple PHC submission using hash chains

From: CodesInChaos
Sent: Wednesday, August 7, 2013 1:11 AM
> The general idea is that you don't keep everything in memory
> you're supposed to, but only an occasional checkpoint. From
> this checkpoint you can recompute memory near it. Often it's
> a good choice to keep sqrt(n) checkpoints from which you can
> recompute any value you're interested in in time n/sqrt(n)=sqrt(n).


I think we call that "rainbow tables"!

- Marsh

Powered by blists - more mailing lists