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 04:15:55 -0500 (CDT)
From: Steve Thomas <>
Subject: RE: [PHC] A (naively?) simple PHC submission using hash chains

> On August 7, 2013 at 3:40 AM Marsh Ray <> wrote:
> 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).
> <lightbulb>Oh!</lightbulb>
> I think we call that "rainbow tables"!

Nope. Anyways rainbow tables are around "n^(2/3)" time and space.

For this it usually takes x times longer for n/x memory.
Content of type "text/html" skipped

Powered by blists - more mailing lists