phc-discussions - RE: [PHC] Initial (non-proof-read) NeolKDF paper

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: <003b01cf1a1b$4e3e5220$eabaf660$@cfl.rr.com>
Date: Sat, 25 Jan 2014 17:17:59 -0500
From: "Gary W. Hvizdak" <gary.hvizdak@....rr.com>
To: <discussions@...sword-hashing.net>
Subject: RE: [PHC] Initial (non-proof-read) NeolKDF paper

Bill Cox wrote ...

If you would like to see the earliest version and maybe provide some
constructive feedback, please feel free to take a look.  It's at:

https://github.com/waywardgeek/noelkdf/blob/master/NoelKDF.odt

--

Bill,

    In 2.1 Simplified NoelKDF, the statement ...

    value = value*(mem[prevAddr++] | 3) + mem[randAddr++];

... is equivalent to ...

    switch ( mem[prevAddr++] | 3 )
    {
        case 0 : value = mem[randAddr++];
break;
        case 1 : value = mem[randAddr++] + value;
break;
        case 2 : value = mem[randAddr++] +               (value << 1);
break;
        case 3 : value = mem[randAddr++] + value + (value << 1);  break;
        default :
    }

... which is surely the route an attacker would take.

Cheers,
Gary