## 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 encryption is 10<sup>300,413</sup> 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<sup>90</sup>**.

* * *

#### safe from Quantum Computers and makes hacking irrelevant

CORA hacking is irrelevant - YouTube

Tap to unmute

[CORA hacking is irrelevant](https://www.youtube.com/watch?v=Bvs1Uh1L_6s) [CORA Cyber Security Inc](https://www.youtube.com/channel/UC_5Hxu4MaVmP4B_kMf2cAyw)

CORA Cyber Security Inc 5 subscribers

* * *

# Quantum-Safe Today

[CORA Cyber Security Inc.](/content/ "CORAcsi"/index.html) embraces perfect encryption using Public Keys that support billions of private keys. [CORA-X](http://cora-x.com/ "CORA-X") uses a minimum of **150 kB** Multiple Use Pad (MUP), resulting in data security that is quantum-safe today and will handle the quantum computers of tomorrow.

### Asymmetric Encryption

A single Public Key corresponds to at most 1 private key.

The public key used by an owner cannot view its own plain text.

Due to attack vectors, the use of ephemeral keys is desired.

Generating ephemeral keys for most Asymmetric algorithms is computationally intensive.

Quantum computers pose a significant risk to factorization based (asymmetric) encryption.

### CORA - a step beyond

A single CORA Public Key supports billions of private keys.

If desired, a unique public-private key combination may readily encrypt/decrypt plain text.

**Probabilistic** in nature; everything changes - Public key size, private key size, number of CORA blocs...

The only attack vector is a brute force attack. If a single byte is corrupted or 'different', then decryption will not happen!

Quantum computers will not break CORA since it is not factorization based and involves unimaginable probabilities!

This makes the reliance on ephemeral keys less important. That said, generating ephemeral keys is fast and effective.

CORA: complex probabilities versus complex math.

* * *