Perfect Encryption

Claude Shannon

Shannon's definition of "perfect encryption" would have the key size at least as large as the data being encrypted.

This level of security was considered to be unneccessary according to the following assumptions

• an attacker cannot execute an arbitrarily large number of attempts/computations in a reasonable period of time.
• the attacker has a miniscule chance of breaking the encryption.

It should be abundantly clear that these assumptions are no longer valid:

1. Moore's law - the power of computers has been doubling every 2 years.
2. Distributed computing - networks of computers can work together and reduce the time needed to break the encryption.
3. Quantum computers are expected to be orders of magnitude more powerful than current, 'electron based' computers.
4. Cyber crime is costing us more than $500 B/year - encryption is being broken.

CORA is a step beyond encryption

What does this mean? CORA may be considered the maturing of 'perfect encryption' as envision by Shannon. Shannon originally identified One Time Pads as perfect secrecy, howver, these are not practical since they should not be used more than once.

CORA has pioneered an innovative approach to One Time Pads; we have invented Multiple Use Pads (MUPs) which have the length of OTPs, however, our MUPs are reusable, fast and practical.

• CORA MUPs are not limited to a fixed size of 128 bits, 256 bits, or 8196 bits.
• CORA blocs are a distributed solution; similar to Blockchains with a centralized control structure (not decentralized, peer-to-perr).
• Each CORA solution is autonomous.

Bottom Line

CORA at its worst, is astronomically (10^358,769 times) more difficult to break, than all other forms of encryption.

CORA is Quantum-Safe today.

CORA at its worst

• Let's say we have a CORA-X solution that has 3 CORA blocs in it.
• 2 out of the 3 blocs are stolen
• While this is unlikely, imagine the hacker has:
  • The catalog file, and therefore knows that there are exactly 3 blocs in this solution
  • There are only 3 blocs in the solution.
  • Finally, we will imagine that the missing CORA bloc is only 1 kB (8000-bits).

Given this scenario in which this CORAfied data is horribly compromised (CORA at its worst), a brute force attack on the missing CORA bloc would require no more than 10²⁴⁰⁸ attempts to obtain the readable data - if CORA didn't have Multiple Use Pads (MUP).

Since CORA is using MUP, even with the execution of this impossibly huge number of attempts, there would be no way to know if a particular iteration was correct!

Next scenerio: CORA-X is using a single CORA bloc.

CORA-X uses a minimum of a 150 kB MUP (1,200,000-bit encryption key).

Since CORA-X's MUP (key) isn't limited to "blocks", many conventional attack vectors are useless.

Compare this to all other forms of encryption , and let us imagine that they are using a 8192-bit key.

A 150 kB MUP is 10^358,769 times stronger.

This makes CORA MUPs capable of withstanding any attack, including those by quantum computers when they arrive on the scene!

For those of you who don't love math as much as we do, lets add some 'perspective' to these astronomical powers:

We don't currently have a name for 10^358,769, so the term "unbreakable" is an appropriate substitute.

Some perspective please:

• the age of the universe is less than 10¹⁸ seconds.
• there are less than 10²⁵ stars in the observable universe.
• the mass of our Sun is less than 10³¹ kg = 10³⁷ milligrams.