phc-discussions - omegacrypt and timing

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-next>] [day] [month] [year] [list]

Message-ID: <CA+hr98H+UFEq=AnPaGJ0xVDTCJPKPmGKajotXydKMQkX7qLMAQ@mail.gmail.com>
Date: Wed, 17 Sep 2014 10:56:36 +0200
From: Krisztián Pintér <pinterkr@...il.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: omegacrypt and timing

can someone explain me how omegacrypt does not leak secret through
timing? i mean total runtime, not cache timing.

in the central part, we derive 0..3 number B from the secret, and
based on that value we do different branches that has different number
of operations. B will on average have all possible values with the
same probability, but there will be a deviation. therefore for two
given passwords, the total running time is different.

i understand that memory latency screws up such fine grained timing,
making practical attacks difficult. but theoretically there is a leak.
am i right?