## 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^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^90**.

* * *

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

CORA hacking is irrelevant - YouTube

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

## White Paper: CORA - patterns and probabilities

This White Paper addresses the simplicity with which a MUP (Multiple Use Pads) can be implemented.  
MUPs are an implementation of OTPs that avoid their limitations which make OTPs impractical.

### One Time Pads

OTPs have perfect encryption as long as:

- they are only used once
- they are as long as the message
- they have a truly random key

### Multiple Use Pads

MUPs have all of the benefits of OTPs without their operational limitations. Most importantly is that:

- they may be reused
- they do not have to be as long as the message
- they do not have to be perfectly random
- a short python file is available at [https://github.com/goCORA/MUP_basic_example](https://github.com/goCORA/MUP_basic_example) to demonstrate that MUPs may be reused

### Context Ordered Replacement Algorithm

The White Paper explores CORA's probabilistic architecture and how it achieves unbreakable security.

- CORA doesn't just resist attacks - it makes them irrelevant.
- By eliminating exploitable structure, CORA renders ransomware inert and ineffective.