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]
From: andfarm at teknovis.com (Andrew Farmer)
Subject: Time Expiry Alogorithm??

On 23 Nov 2004, at 15:02, Florian Weimer wrote:
> * 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.

On the other hand, we have yet to create a practical quantum computer.

>> (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.

On the other hand, we have yet to discover a way to circumvent the 
second
law of thermodynamics.

If quantum computing comes through (and I doubt it will), we'll all 
start
using quantum encryption. Until then, 256 bits is good enough for me.
-------------- 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/d67b2563/PGP.bin

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ