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 for Android: free password hash cracker in your pocket

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

From: andfarm at teknovis.com (Andrew Farmer)
Subject: Time Expiry Alogorithm??

On 22 Nov 2004, at 12:47, Florian Weimer wrote:
> * Georgi Guninski:
>> would prefer to keep my secrets encrypted with algorithm whose 
>> breaking
>> requires *provable* average runtime x^4242 or even x^42 instead of
>> *suspected runtime* 2^(x/4).
>
> It depends on the constant factors you omitted, including those in the
> lower-order terms. 8-)
>
> AES can be broken with O(1) effort, but the constant is so huge that
> it's considered impractical.  IIRC, OpenPGP has an upper bound for key
> length, too, so it too can be broken with O(1) effort as well.
> Obviously, this isn't particularly meaningful.

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.

(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...)
-------------- next part --------------
A non-text attachment was scrubbed...
Name: PGP.sig
Type: application/pgp-signature
Size: 186 bytes
Desc: This is a digitally signed message part
Url : http://lists.grok.org.uk/pipermail/full-disclosure/attachments/20041123/29eabcf2/PGP.bin