Date: Sun, 29 Dec 2013 20:28:28 -0800 From: Stephen Touset <stephen@...set.org> To: crypt-dev@...ts.openwall.com Subject: Re: Password Scrambling On Dec 29, 2013, at 6:08 PM, CodesInChaos <codesinchaos@...il.com> wrote: > The attack as I originally envisioned it doesn't work. Value > recalculation produces a tree which can be recomputed on the fly, but > that needs n not sqrt(n) cores, making it useless. I'm leaning towards > considering catena secure, but will need to think more about it. Does this mean it actually satisfies the requirements of a sequentially memory-hard function, then? I’d be extremely interested in seeing the reasoning you used to come to the conclusion that it’s *not* susceptible to a standard TMTO. — Stephen Touset stephen@...set.org
Powered by blists - more mailing lists
Confused about mailing lists and their use? Read about mailing lists on Wikipedia and check out these guidelines on proper formatting of your messages.