One-time pad: the only unbreakable encryption

Using one-time pad encryption is employing an equation with two unknowns, one of which is truly random – and henceforth making the equation mathematically unsolvable. Which is good news, if you happen to use one-time pads.

And which is bad news if you don’t.

So, according to a well-known expert on encryption, “even infinite computational power and infinite time cannot break one-time pad encryption, simply because it is mathematically impossible“.

While there are countless ciphering and encrypting methods around, what they offer is not more than a promise that it would be hard to crack them. And if it would take long enough time to crack them, then all is fine. This approach suits most fields, but only only until AI-driven fuzzers, clusterized supercomputers or the emerging quasi-quantum computers appear on the scene.

And that point in time is about now. 

According to the expert: “Whatever technological progress may come in the future, one-time pad encryption is, and will remain, the only truly unbreakable system that provides real long-term message secrecy“.

The thing is with the one-time pad is that it will never get out of shape. No machine will ever be built which could crack messages encrypted in this way. I am in no way saying that we should encrypt our communications with one-time pads, but I propose you to learn how to use it.

Essentially it needs three ingredients: a paper, a pen and a 10-sided dice. Then we need to have the message that needs encrypting. And lastly a series of truly random digits, whinc is as long as the message – which is called a key. If you are using the key once and then destroy it – noone will be able to read it – ever. Of course it is imperative to supply the key to the receiver, but if it is destroyed after reading it, then all is well.


You could find step-by-step instructions here in the use of one-time pads:

Be the first to comment on "One-time pad: the only unbreakable encryption"

Leave a comment

Your email address will not be published.