The One-time Pad: Unbreakable encryption

One of the biggest issues with data encryption is that almost all encryption can be decrypted by a determined “enemy” with enough computer resources and sufficient time.

Ciphers that are based on a password can be broken by brute force techniques such as trying every every single password. Longer passwords help but at best they simply buy you some time.

The rapid development of quantum computers may soon allow much faster factoring of prime numbers and threaten ciphers such as RSA which exploit the difficulty factoring large prime numbers.

Wouldn’t it be great if there was a cipher that couldn’t be broken by any modern computer? Would you like a cipher that could NEVER be broken? Continue reading “The One-time Pad: Unbreakable encryption”