The Bound of Post Quantum Multivariate Polynomial Cryptal

This code is to simulate and calculate the hacking bound for post quantum cryptography with multivariate quadratic polynomial as an example

The zero-knowledge password proof is one kind of zero knowledge proof, which allows one party (the certifier) to prove to the other party (the verifier) that it knows the value of the password without revealing any other information, defined in IEEE p1363.2. With potential coming quantum computer attack, post quantum lattice or more general bi-ideal based private and public key pairs are needed to escalate the zero-knowledge password proof paradigm. The illustrative bound is given here with the simulation and calculation of the potential brute force broken probability for a simple genetic example of multivariate quadratic polynomial.