[cryptography] The Unbreakable Cipher

Greg Rose ggr at seer-grog.net
Wed Sep 25 13:30:01 EDT 2013


On Sep 25, 2013, at 9:40 , Jonathan Katz <jkatz at 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 traffic is larger than the key length.

regards,
Greg.


More information about the cryptography mailing list