### Learning about Post Quantum cryptography (PQC)

Why do we need post quantum cryptography (PQC) Public-key cryptography relies on mathematical functions that are easy to do and hard to undo. Classical cryptographic algorithms, such as RSA (Rivest-Shamir-Adleman), and ECC (Elliptic-curve cryptography); based on the difficulty of factoring the product of two large prime numbers and of the elliptic curve discrete logarithm problem are widely used today to encrypt data sent over the web. Such algorithms are difficult for classical computers to solve in a reasonable amount of time. However through the use of Shor's algorithm a sufficiently large quantum computer can easily break such encryptions. -- video describing how quantum computers can break classical cryptographic algorithms . -- video describing how Shor's algorithms works . While experts estimate that it will take around 10 years for a sufficiently large quantum computer capable of breaking existing encryption algorithms to be made , there is still a great need for