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: Thu, 24 Mar 2016 13:15:22 +0100
From: Dmitry Chestnykh <>
Subject: Re: [PHC] hash encryption

> Thinking of it some more, the exception may actually be important, still
> allowing to attack the last 1 or 2 rounds.  So my proposed change isn't
> as complete a mitigation as hashing in the key length would be.

What about starting a round counter (which gets hashed) from a different, non-overlapping, value for different key sizes?

128-bit key: round# = 0, 1, 2, 3
256-bit key: round# = 10, 11, 12, 13, 14, 15, 16

Dmitry Chestnykh
Coding Robots

Powered by blists - more mailing lists