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. Moreover CORA has evolved beyond the limited perspective that the key must be a separate entity.

  • CORA blocs are not limited to a fixed size of 128 bits, 256 bits, or 5000 bits.
  • Each CORA bloc essentially functions as a key that is needed to reassemble the readable data.
  • CORA blocs have a greater length than the relational data contained therein. Hence the notion introduced by Shannon is satisfied in the sense that the "complexity" of the unknown data (key) is greater than the actual data (message).
  • Each CORA solution is autonomous; the analogy here is that the same key should never be reused.

Bottom Line

CORA at its worst, is astronomically (101848 times) more difficult to break, than military grade encryption at its best.

or, more concisely, CORA is unbreakable

CORA at its worst

  • 3 CORA blocs in the solution.
  • 2 out of the 3 blocs are stolen
  • The blocs are at the minimum size required for CORAfication.
  • The hacker has:
    • The catalog file.
    • The chaos maps.
  • The thief knows:
    • There are only 3 blocs in the solution.
    • The size of the 3rd bloc.
    • The relevant order of blocs including boundary conditions.

Given this scenario in which this CORAfied data is horribly compromised (CORA at its worst), a brute force attack would take no more than 102400 attempts to obtain the readable data.

Contrast this to military grade encryption that uses a 256 bit key, in which no more than 2256 or approximately 1078 attempts are needed to break the encryption.

This means that CORA at its worst is 102322 times stronger than military encryption.

If one were to implement an optimized attack pathway that takes into account the likely frequency distributions of byte patterns involved, and patterns associated with random number generators, then let's liberlly say that the attack vector might be effectifly decreased by 20%. This would result in as little as 101926 attempts, or 101848 times stronger than military based encryption.

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

If the strength of CORA was just
1081, then it would be 1000 times stronger
1084, then it would be one million times stronger
1087, then it would take approximately one billion times more time to break than current implementations of military grade encryption.

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

Some perspective please:

  • the age of the universe is less than 1018 seconds.
  • there are less than 1025 stars in the observable universe.
  • the mass of our Sun is less than 1031 kg = 1037 milligrams.