Devlog 2: Securing the Keys

So guys, Earlier I implemented the Shor's algorithm that shows how Traditional encryptions could be broken easily with Quantum computers, this time I did demonstration of how we can protect our Secrets from Quantum technology.

Basically If you know about Cryptographic encryptions, you might know that we actually never reveal the secret keys while communicating with other parties instead we use our Public keys to do so, which is nothing but simply a mathematical wrap that is generated with help of secret keys and then mathematical blanket over it makes it harder to guess which secret keys might have generated that Public key.

Both Traditional and Post quantum cryptography are different ways to wrap that secret against the potential threats. Earlier when we used very large prime number we relied on computational limits of classical computers that they will practically take so much time to break the pattern and we enjoyed the security until quantum computers came and started to break that same computational limits at very fast pace, then we needed something that QPUs cannot break and we decided that we would use methods which is not a mathematical complexity but just complete chaos and randomness.

One of popular way is Lattice cryptography where we insert random errors in public keys that no obvious pattern is recognized by Quantum. Hence safe against QPU and Classical both.

I have used simple linear equations instead of how actual matrices used by real life encryptions but for understanding analogically same things that generates public output(b), public keys (a), inserted error and bounded by particular modulus.

The idea is same that we would use these Linear equations for Cryptographic handshake between different parties. Noise would make it difficult to reveal secret hence our Objective is fulfilled.

You can play with Parameters and if you have some idea and want to contribute, the repo is open.

Thanks for Reading!