Why is CORA quantum safe?

CORAcsi - quantum safe cryptography

Why is CORA unbreakable?

To unCORAfy (decrypt) data that has been secured with CORA, an attacker/thief must know:

1.       The Multiple Use Pad (MUP) in its entirety:

a.       must know its length. This primary MUP length begins at 150 kB and has no ceiling.

b.       must have "every byte" without exception

2.       The user preferences binary array:

a.       a secondary, specialized MUP (smaller in size, though still far beyond current standards for key lengths).

b.       multiple parameters needed to successfully use the primary MUP cited above.

c.       user preferences and identifiers.

3.       The CORA catalog for a particular solution.

4.       The CORA blocs for a particular solution:

a.       must know how many CORA blocs are involved.

b.       must have each CORA bloc's length.

c.       must have 'each byte' of all CORA blocs.

CORA is probabilistic in nature; it is not factorization based!

Due to the implementation of our MUPs, heuristically based analysis, including those cited in the literature for One Time Pads (see Venona Project), will not reveal the MUP.

Side channel attacks will not work. Factorization based analysis (including Shor and Grover's algorithms) will not work.

The only way to obtain the MUP is by a brute force attack; which cannot be realized due to the size of our MUPs. Quantum computers are expected to reach 10¹⁸ calculations/second within 10 years. Should they magically reach 10¹⁰⁰ calculations/second, there still wouldn't be enough time - in the life of our universe - to break a 150 kB MUP.

To further protect the MUP, CORAcsi has implemented its own memory manager – to cover the possibility that protected memory might be susceptible to a back door or otherwise unknown attack.