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]

Message-ID: <49868053ad0545bf800a4b9d696f7d66@BLUPR03MB166.namprd03.prod.outlook.com>
Date: Wed, 7 Aug 2013 09:12:56 +0000
From: Marsh Ray <maray@...rosoft.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: RE: [PHC] A (naively?) simple PHC submission using hash chains

From: CodesInChaos [mailto:codesinchaos@...il.com]
Sent: Wednesday, August 7, 2013 12:46 AM
>
> For the first step a machine with pmem^{1/2} memory which
> stores every pmem^{1/2}th value. This runs in pmem time

I could see how one could do it if it were ‘append’ instead of ‘prepend’, but how does one run

      pmem.times do
        chain.prepend(link)
        link = hash.call(salt, link)
      end

in just pmem time?

Are you perhaps treating hash.call as constant time, or counting the individual hash compression function invocations?


-          Marsh



Content of type "text/html" skipped