[147788] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: [Cryptography] [RNG] on RNGs, VM state, rollback, etc.

daemon@ATHENA.MIT.EDU (Jerry Leichter)
Mon Oct 21 17:56:48 2013

X-Original-To: cryptography@metzdowd.com
From: Jerry Leichter <leichter@lrw.com>
In-Reply-To: <1382363303.6689.15.camel@heisenberg.scientia.net>
Date: Mon, 21 Oct 2013 15:35:53 -0400
To: Christoph Anton Mitterer <calestyo@scientia.net>
Cc: cryptography@metzdowd.com
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com

On Oct 21, 2013, at 9:48 AM, Christoph Anton Mitterer <calestyo@scientia.net> wrote:
>> We *all* know that all cryptography can be cracked; it's just a matter
>> of resources and time.
> *cough* OTP...
...and this is the difference between real-world cryptanalysis and mathematical cryptanalysis.

Mathematical cryptanalysis, given infinite time and resources, can do nothing about OTP.

Real-world cryptanalysis, given sufficient, very finite, time and resources, can break into secure facilities and computers, bribe or blackmail people, tap into various kinds of leakage channels ... and break OTP.

                                                        -- Jerry

_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography

home help back first fref pref prev next nref lref last post