Make the hack irrelevant with CORA's Quantum Safe encryption. Faster and safer than you might imagine! Cyber hygiene doesn't have to be a burden and a breach doesn't have to be a public relations nightmare.

1. CORAcsi.com CORA-X.com
CloudCORA.com Page 1 of 2 support@CORAcsi.com
CORA is quantum safe cryptography today!CORA empowersunbreakable security fordataand
communicationtoprotect information,companies,organizationsandpeople.
Abstract
CORA CyberSecurityInc.has pioneeredQuantumSafe Cryptographythroughthe use of:
1. Multiple Use Pads(MUPs).MUPsare similartoa "One Time Pad" (Vernam-cipherorthe perfect
cipher) exceptthatthey are reusable,practical andefficient.
2. CORA blocs – a distributedsolutionakintoBlockchains,withoutbeinga"decentralized,peer-to-
peer"technology.Thismeansthatcontrol overthe solutionremainssecurely"inhand".
3. Block free encryption.Unlike otherstandardsof encryption,the nature of ourMUPs is suchthat
there isno limittothe size of one of our keys(MUPs).Thisfurtherresultsinthe freedomfrom
iteratingoverafinite,constantandpredeterminenoof bytes(blocks).
Current standards of encryptioncan and have beenbroken,evenwhenproperlyimplemented. When
quantumcomputersarrive intheirfull glory,currentstandardsof encryptionwill be rendereduseless!
The technology
CORA is probabilisticinnature,requiringunimaginablylarge numberof attemptstobreak.When
properlyimplemented,the onlyattachvectoragainstCORA isa brute force attack, whichcannot
succeedwithinthe lifespanof our universe.
MUPsbeginat 150 kB andhave no ceiling.CORAcsi hascurrentlyimplementedMUPsrangingfrom150
kB to 5 MB. This resultsinaprobabilisticimplementationratherthana factorizationbasedtechnology
(quantumcomputerswill decimate factorizationbasedalgorithms).
Directimplicationsforattackers:
1. theycannot assume a"blocksize"forthiscryptography.
2. theycannot assume atype of implementationorsize of key.
3. theydon't have enoughcomputingpower(includingquantumcomputers)tobreaka
150 kB MUP (key). A 150 kB MUP is infinitelystrongerthan2048 bitencryption
(10360,000
timesstronger)
CORA tendsto generate between2and12 CORA blocs.Each CORA bloc issecuredwitha MUP –
individuallyandcollectively.CORA blocsdecomposethe original dataintominisculebytes.EachCORA
blocis requiredinitsentirety,alongwiththe MUPand userpreferencesinordertorecombine the data.
Directimplicationsforattackers:
1. theymustknowthe identityof eachCORA blocin a particularsolution.
2. theymustacquire everyCORA bloc.
3. theymustacquire the MUP.
4. theymustacquire the unique userpreferencesarray.

2. CORAcsi.com CORA-X.com
CloudCORA.com Page 2 of 2 support@CORAcsi.com
CORA handlesitsownmemorymanagement.While hardware andsoftware vendersoffer"protected
memory",CORAcsi preferstotake additionalstepstosafeguardthe MUPand data againstpotential
"back doors"to the processingmemoryandregisters.Moreover,aserverthatmay be up and running
for daysor weeksmustminimizethe pitfallsassociatedwithmemoryfragmentation.
Benchmarks
The followingbenchmarksare baseduponthe following:
 an Intel(R) Core(TM) i7-6700CPU @ 3.40GHz, 3408 Mhz, 4 Core(s),8Logical Processor(s).
 x64-basedarchitecture.
 CORA'smemorymanagerallocatesandusesupto 10 GB of RAM.
Table #1: Resultsfora 2 GB binaryarray (timesare in seconds)
# of CORA blocs (requested)
4 8 12
CORAfy 6.0 4.7 5.1
unCORAfy 7.4 5.8 6.0
Table #2: Resultsfora 2.1 GB file including"harddrive"operations(save andread)
# of CORA blocs (requested)
4 8 12
CORA Save (CORAfy and saveCORA blocs) 11 10 12
CORA Read (unCORAfy from CORA blocs) 13 12 16
Additional filesrangingfrom20 B to 2.1 GB were saved(CORAfiedandsavedtoCORA blocs) then
opened(unCORAfiedfromCORA blocs).The average timesinseconds/GB are showninthe nexttable.
Table #3: Resultsforfilesvaryingfrom 20 B – 2.1 GBincluding"hard drive"operations.
# of CORA blocs (requested)
4 8 12
CORA Save then CORA Read 1.9 s / GB 1.8 s / GB 2.1 s / GB
a matterof time