Live data from Hacker News

"Unbreakable" Encryption Almost Certainly Isn't

schneier.com

61–62 of 62 posts

Re: "Unbreakable" Encryption Almost Certainly Isn't

#61
post #42

It's always kind of cute to see ridiculous headlines roll through. Taking a look at the paper and a stream of thought about it. - Researchers are affiliated with a university they aren't kooks - These are physicists. They speak a different language. That will make decoding this paper difficult. It may have useful insight, but it is obscured by the jargon of a different discipline. Typically I haven't see continuous d…

I think by unbounded they meant 'you can stick any number of arbitrarily complicated functions here'. I'm not sure whether this is any different in practice from just upping the key size on a cipher (since any implementation will be limited by at least memory used to represent the functions).

Re: "Unbreakable" Encryption Almost Certainly Isn't

#62
post #8

Earlier quoted context omitted.

"unbreakable" may be not well-defined, but perfect secrecy is[1]. 1. http://en.wikipedia.org/wiki/One-time_pad#Perfect_secrecy

Perfect secrecy refers to the ability to determine any information about the plaintext without decoding it. Not having it can be very useful to an attacker, but that isn't always the case. RSA, for instance, doesn't have perfect secrecy, because it leaks the Jacobi symbol ( https://en.wikipedia.org/wiki/Jacobi_symbol ) of the plaintext. However, that information is of limited utility, and it can be shown that determi…

Actually, perfect secrecy refers to the ability to determine any information about the plaintext at all, given arbitrary decoding power. It's quite simple -- it means that given a standard distribution of keys and an a priori distribution over the plain texts the best estimate of the plaintext given the ciphertext is simply the a priori distribution (no additional information). For the binary case, Y(any distribution)+X(uniform)=Z(uniform) (mod 2), so that this is satisfied for any prior.
Post reply on HN