CORA Cyber Security Inc. has championed **Probabilistic encryption** while embracing what Claude Shannon addressed as 'perfect encryption'. CORA-X uses a minimum of **125 kB** Multiple Use Pad (MUP), resulting in data security that is quantum-safe today and will handle the quantum computers of tomorrow.

**Finite** key sizes to encrypt.

Depends on **complex math**ematical (beautiful) algorithms.

Breaking the encryption is often based upon **factor**ization, or another mathematically challenging pathway.

**Probabilistic** in nature; with so many mathematicians, and highly motivated intellectuals with powerful computers, the one hurdle they can't jump, are enormous probabilities.

Moreover, CORA makes 'everything' a variable. Example, no two keys need be the same size!

**Multiple Use Pads** (**MUP**s) have no limit. CORA-X uses a minimum of 125 kB MUP (equivalent to 1,000,000-bit encryption).

CORA: complex probabilities (unimaginably enormous) versus complex math.

Without getting into great detail, let's approximate:

- Today: 304,510 M
**I**PS ~**10**^{11} - Hopeful prediction for Quantum Computers:
**10**/second^{18}calculations - Over-estimate: imagine
**10**calculations/second^{100}

Remember, CORA isn't based upon factors, but rather probabilities.

Maximum # of attempts needed to break a 125 kB MUP, acting on a **single** CORA bloc is **10 ^{301,029}**

**Perhaps** on average, an attacker may accomplish this in one-hundredth of this maximum: **10 ^{301,027}**

In this case, a quantum computer capable of **10 ^{100} would break this in just,10^{300,927} seconds**.

Consider that there have been only 10

The author imagines that smart and innovation approaches may reduce this unimaginably large probability down, lets say by 99%, to **10 ^{3,009}**.

Even in this case, the time required at **10 ^{100}** calculations per second, is

Our planet will be gone, and we will be living amongst that stars, within **10 ^{18}** seconds