White Paper: CORA - Patterns and Probabilities

Quantum Computers will not break CORA!

What is needed to read the encrypted (CORAfied) data?

  • The Encryption package.
    • Multiple Use Pads (MUPs) are fast and reusable OTPs which have long been identified as 'perfect encryption'.
    • CORA's MUPs vary in size. Why give a hacker 'any' information including the length of the encryption key?
    • Unlike other forms of encryption in which each key is the same size, CORA is probabilistic and varies just about everything including the length of the MUP.
    • MUPs are more than 1 million bits long; nothing compares to CORA.
    • 1,000,000+ bit encyrption is 10 300,413 times stronger than 2048 bit encryption
    • The MUP is dispersed and only exists as a complete key 'in memory'.
  • The catalog.
    • Connects the CORA blocs with the readable data.
    • Centrally controlled.
    • CORAfied (encrypted).
  • The CORA blocs.
    • CORA is a distributed solution.
    • The number of CORA blocs varies.
    • Each CORA bloc is needed without exception and without corruption.
    • Each byte in each bloc must be exact; there cannot be any modification what so ever.
    • Ideally CORA blocs will be dispersed on 'different' devices and/or in the Cloud.
    • With CORA, the Cloud becomes a value-added resource; a corporation (such as a bank) becomes more secure by saving 1 or 2 small, 2 kB CORA blocs to the Cloud, while keeping the rest in their data center.

make hacking irrelevant

What are the chances that a hacker will guess which 2, 3, 4... 40 CORA blocs go with one another?

Option 1 - we don't require that the CORA blocs be entered in the proper order. The total number of combinations to test between 2 and 40 CORA blocs is only (and that is with the MUP - which should never happen):

That's right, 1042 - unimaginable, and that's with only 200 CORA blocs.

Option 2 - we require the proper order - then the total # of permutations is 1.68 x 10⁹⁰.

safe from Quantum Computers and makes hacking irrelevant

CORA hacking is irrelevant - YouTube

Tap to unmute

CORA hacking is irrelevant CORA Cyber Security Inc

CORA Cyber Security Inc 5 subscribers

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 unnecessary 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 envisioned by Shannon. Shannon originally identified One Time Pads as perfect secrecy, however, 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-peer).
  • Each CORA solution is autonomous.

Bottom Line

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

CORA is Quantum-Safetoday.

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 102408 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 scenario: 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⁵⁸,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, let's add some 'perspective' to these astronomical powers:

We don't currently have a name for 10⁵⁸,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.