full-disclosure - Time Expiry Alogorithm??

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: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <87oehodv92.fsf@deneb.enyo.de>
From: fw at deneb.enyo.de (Florian Weimer)
Subject: Time Expiry Alogorithm??

* Andrew Farmer:

> Especially considering that there aren't enough atoms in the universe to
> store all that precalculated data, nor enough energy to do all the
> calculations.

Typically, such estimates ignore the possibilities of quantum
superpositions.

> (Schneier says that there's enough energy in a supernova to do about
> 2^224 operations on a 100% efficient computer. And remember that AES
> or PGP take multiple operations to calculate results...)

Schneier's estimates are wrong.  They are based on the incorrect
assumption that all bit operations are irreversible and
entropy-increasing.  There is no hard evidence that this is true in
general.