Saturday, 3 December 2016


Venona project (1943–80)

I have read that this was one of the most successful counter-intelligence efforts of the Cold War; purportedly successful because individual(s) on the soviet side began to reuse keys, rather than generating a new key for each message.

Perfect Encryption


Claude Shannon is accredited with defining the idea of "perfect encryption" in which the encryption key would be, at least as long, as the message.
These two paths from our collective HISTORY converge with CORA, and become THE FUTURE of data security.

CORA stands for Context Ordered Replacement Algorithm.

While the 'magic of CORA' temporarily remains a trade secret, the following expose makes for an acceptable 'letter of introduction' to CORA.
 Context Ordered infers that the same CORA bloc (key in the Venona project cited above) will always be created anew when 'CORAfying' data.
Replacement Algorithm infers that each CORA bloc's relevant data (perfect encryption cited above) should span a proportionate size that exceeds the relative data.

Bottom Line

A CORAfied solution at its worst, is far more than a 'googol' times stronger than military grade encryption, at its best.

CORAfied - 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.
Giving this scenario in which the CORAfied data is horribly compromised, a brute force attack would take no more than 102400 attempts to obtain the CORAfied data.

Contrast this to military grade encryption that uses a 256 bit key which would take no more than 2256 1078 attempts to obtain the encrypted data.

Hence CORA at its worst is 102322 times stronger  - a step beyond encryption! 
I prefer to refer to this as "astronomically stronger" or "unbreakable"!

Addendum (4 Dec 2016)

It should be noted that patterns in random number generators, and optimization routines based upon frequency distributions in the byte structures will result in the potential for optimizations. Taking a smarter approach based on these patterns might pragmatically decrease this complexity of the attack pathway by 20%, which could result in as little as 101926  attempts, or 101848 times stronger than military based encryption.
The enormity of this number is still astronomical unbreakable

No comments:

Post a Comment