On 09/25/2013 03:51 PM, Jonathan Katz wrote:
On Wed, Sep 25, 2013 at 1:30 PM, Greg Rose g...@seer-grog.net
mailto:g...@seer-grog.net wrote:
On Sep 25, 2013, at 9:40 , Jonathan Katz jk...@cs.umd.edu
mailto:jk...@cs.umd.edu wrote:
Every cipher is breakable, given enough traffic: in
On Wed, 2013-09-25 at 10:11 -0400, John Young wrote:
[Answer to the question:] Does there exist an unbreakable cipher
would be this, Every cipher is breakable, given enough traffic, and
every cipher is unbreakable, if the traffic volume is restricted
enough.
[End quote]
Is this
- Forwarded message from coderman coder...@gmail.com -
Date: Wed, 25 Sep 2013 23:38:58 -0700
From: coderman coder...@gmail.com
To: brian carroll electromagnet...@gmail.com
Cc: cpunks cypherpu...@cpunks.org
Subject: Re: The Unbreakable Cipher (2)
On Wed, Sep 25, 2013 at 9:29 PM, brian
For your question: Session keys and key rotation?
Den 25 sep 2013 16:11 skrev John Young j...@pipeline.com:
NSA Technical Journal published The Unbreakable Cipher in Spring 1961.
http://www.nsa.gov/public_info/_files/tech_journals/The_Unbreakable_Cipher.pdf
Excerpts:
[Quote]
David Kahn,
On Wed, Sep 25, 2013 at 10:11:33AM -0400, John Young wrote:
Is this conclusion still valid? If so, what could be done to restrict traffic
volume to assure unbreakablility? And how to sufficiently test that.
You need to be able to estimate the rate of information leakage.
This seems to be
On Wed, Sep 25, 2013 at 10:11 AM, John Young j...@pipeline.com wrote:
NSA Technical Journal published The Unbreakable Cipher in Spring 1961.
http://www.nsa.gov/public_info/_files/tech_journals/The_Unbreakable_Cipher.pdf
Excerpts:
[Quote]
David Kahn, Lyen Otuu Wllwgh WI Etjown pp. 71,
On Sep 25, 2013, at 9:40 , Jonathan Katz jk...@cs.umd.edu wrote:
Every cipher is breakable, given enough traffic: in principle, yes, as long
as the traffic (formally, the entropy of the traffic) is larger than the key
length.
You misstated this. It's breakable if the *redundancy* of the
On Wed, Sep 25, 2013 at 1:30 PM, Greg Rose g...@seer-grog.net wrote:
On Sep 25, 2013, at 9:40 , Jonathan Katz jk...@cs.umd.edu wrote:
Every cipher is breakable, given enough traffic: in principle, yes, as
long as the traffic (formally, the entropy of the traffic) is larger than
the key
