SoylentNews is people
SoylentNews is powered by your submissions, so send in your scoop. Only 15 submissions in the queue.
SoylentNews
An Anonymous Coward has submitted the following:
The UK government will tomorrow publish draft legislation to regulate the use of encryption and require ISPs to log which websites their customers visit for a year. The government has previously expressed irritation at the idea of some communications being out of government reach. There is an (inevitably toothless) petition.
The silver lining is perhaps that the government still cannot comprehend that not all secure communications involve a communications provider. The government appears to be using the door in the face technique, making the bill as over the top as possible so they can appear to compromise later.
This discussion has been archived.
No new comments can be posted.
UK Wants to Ban Unbreakable Encryption, Log which Websites You Visit
|
Log In/Create an Account
| Top
| 22 comments
| Search Discussion
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
We lie loudest when we lie to ourselves.
-- Eric Hoffer
(Score: 3, Informative) by edIII on Thursday November 05 2015, @12:06AM
Well... more accurately OTP has as many decrypted versions as the possible permutations of the dataset itself .
It's not big key (K) and encrypted text (E), it's Key (K) and CipherText (C), and they are perfectly equal in size. Therein lies the truly unbreakable encryption, of which to my knowledge, OTP is the only one that claim that title.
The why is simple.
0 1 0 1 0 1 0 1 1 0 (P)
1 0 1 0 1 0 0 1 1 0 (K)
0 1 1 0 1 1 1 0 0 1 (C)
I know they don't line up without a monospaced font (I'm too lazy today), but the unbreakable part comes from the fact that the first pair of PK (column) is wholly disconnected from the 2nd, and the 10th pairs. The operation is purely non-deterministic because of this. Typical encryption is not, and because Key (K) is a small insignificant size compared to CipherText (C), the 1st, 2nd, and millionth pairs are related and deterministic. Hence, they are mathematically provable to be breakable under the right conditions. Doesn't matter that science says multiple stars are required to break it either. It's nearly impossible to securely exchange your keys when they are the same size as the dataset, which is why we use Diffie-Hellman, and because of poor implementations of it, encryption is routinely broken.
In court, it's 100000000% impossible for a mathematician to state that any dataset is more probable than any other dataset when using OTP correctly. Meaning, ALL cases of Plain Text (P) are equally possible from CipherText (C) where Big Key (K) is missing and unavailable.
Big Key (K) is the proof itself of which dataset is actually contained in CipherText (C). So, without decrypting OTP, you can't prove the contents of OTP. Where you show designs for a bomb, I can show you a picture of monkeys writing Shakespeare. Or your mom blowing Putin. Or Putin blowing your dad. Anything is possible. That's the point :)
Mathematically pure unbreakable encryption
I'll leave it to other experts to explain why OTP will sadly never be widely used for anything....
Technically, lunchtime is at any moment. It's just a wave function.