What does Impossible look like?

Try it, you won't succeed, but you will like the certitude that your data and communication can be safe and unbreakable

Data security (static data)

Download 2 images, and 2 of 4 CORA blocs:

Imagine a hacker breached your server and stole these 2 CORA blocs.

You will never produce these 2 images using these 2 CORA blocs!

Dare you prove us wrong?

Sample for Analysis.zip

This sample is based upon CORA gen 1. We would prefer that you wait for gen 2, however it is available as a muse (project) as you await the arrival of CORA gen 2.

CORA gen 2

March 31, 2017 - Generation 2 is coming.

With Gen 2 CORAcsi introduces
"Multiple Use Pads" (MUPs). Patent pending

CORA is the first to invent, and use MUPs. MUPS are a practical and reusable form of One Time Pads (OTP), which have long been accepted as the ideal in 'perfect secrecy' as is taught in 'information theory' and cryptography. While these OTPs have been a theory since they aren't practical, Latouf has invented a secret sauce that turns OTPs into MUPs, which are practical and reusable.

MUPs break the barriers that exists with finite key size encryption. MUPs are a probabilistic approach to security that allows for a single type of attack � a brute force attack, which due to the astronomically high probabilities, cannot be completed within the life time of our universe (times a trillion).

CORA for Industry

CORA's 'trust independent', self-healing technology secures:
  1. data
  2. real-time communication
  3. systems integration
  4. authentication
  5. communication
  6. robotics
  7. manufacturing
  8. automation & mobility
  9. connected vehicles
  10. the Internet of Things
for companies and organization that need to operate securely and efficiently, 24/7.
perfect secrecy - perfect encryption - CORA unbreakable - 101104 times strong than other encryptions - CORA Connect for Industry, automation and mobility

What does 'unbreakable' look like?

Claude Shannon

Claude Shannon is considered by many to be the father of information theory.

The Claude E. Shannon Award is an coveted honour in the field of information theory.

Shannon introduced, perhaps even originated the concept of "perfect encryption" in 1949.

The concept is known by other names as well:

Bottom line: a one-time key that is longer than the data.

perfect secrecy - perfect encryption - CORA unbreakable - 101104 times strong than other encryptions - CORA Connect for Industry, automation and mobility

Perfect Encryption

Current standards in military grade encryption are reported to use 256 - 4096 bit encryption, depending on the type of encryption.

How does this compare to CORA?

Every single CORAfication of data involves automous CORA blocs, which adheres to Shannon's ideal of perfect encryption using a "one time only, unique key".

perfect secrecy - perfect encryption - CORA unbreakable - 101104 times strong than other encryptions - CORA Connect for Industry, automation and mobility

The Math - beyond a googolplex

What is a googol? It is 10100. What's a googolplex? 101000

CORA at its worst is more than 101104 times strong than military grade encryption.

Example

If a brute force attach could break military grade encryption in '1 second',
then it would take 101104 seconds to break CORA.

How big is that?
... it is way more than a googol (zillion, zillion...) times the age of our universe (since the big bang).

Lets put this another way, if military grade encryption is '1 grain of sand', then 101104 is bigger than our entire universe.

That's why it is so much easier to say "unbreakable" !