phc-discussions - Re: [PHC] A (naively?) simple PHC submission using hash chains

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

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 11:20:45 +0200
From: CodesInChaos <codesinchaos@...il.com>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] A (naively?) simple PHC submission using hash chains

`hash.call(salt, link)` is constant time. salt has constant size, link has
constant size so the input has constant size.
So it doesn't matter if I count compressions or invocations here.
This doesn't hash the whole chain on each iteration. link != chain

> I think we call that "rainbow tables"!
Rainbow tables are somewhat similar, but not the same thing.

Content of type "text/html" skipped