Quantum algorithms have serious threat for public key cryptography. A study proves that there is no polynomial sizes quantum circuits for computing all Boolean functions. Public key cryptography is designed based on data complexity and NPC problem, which can be used in the nesting of the classical cryptosystems, and it is conducive to system upgrade.
↧