Post Quantum Cryptography in Everyday Language

Compare RSA and elliptic curve cryptography, linking factoring primes to discrete logarithms on curves, and explain why ECC achieves equivalent security with smaller keys for online banking and mobile apps.

Enable secure communication as Alice and Bob derive a shared secret from public numbers via diffie-hellman, then encrypt with AES while eavesdroppers see only random-looking values.

The quantum threat to public key cryptography comes from Shor's algorithm, using quantum parallelism to factor large numbers and compute discrete logarithms, reducing the time to break 2048-bit RSA keys.

Explore post-quantum cryptography timelines for RSA and classical ciphers, comparing industry leaders' predictions and hurdles like quantum error correction and millions of qubits.

Qubits remain fragile, decohering within microseconds unless isolated near absolute zero. The lecture explains error correction codes, creating a single logical qubit, and scaling to thousands or millions.

Learn how post-quantum cryptography creates algorithms resistant to both classical and quantum attacks, using lattice structures, error-correcting codes, or combinatorial designs to secure the future.

Explore lattice theory, where high-dimensional lattices and the shortest vector problem challenge brute force. Leverage this hardness to underpin post-quantum schemes like kyber and dilithium, resisting quantum attacks.

Explore learning with errors as a cornerstone of post-quantum cryptography by introducing small noise into linear equations like x plus b equals y, making high-dimensional solutions harder.

Explore hash-based signatures as a simple, robust post-quantum approach using hash-path verification and precomputed leaf values to ensure authenticity.

Rely on error-correcting codes to enable post-quantum cryptography, then scramble them to resist quantum attacks. Deliver fast encryption with large keys like Macaulay and Goppa codes, enduring decades under scrutiny.

Explore multivariate and isogeny-based cryptography as post-quantum solutions, building intuition for hard multi-variable polynomials and elliptic-curve isogenies powering secure public keys and signatures.

Explore fully homomorphic encryption, or FHE, as a post-quantum approach that enables computations on encrypted data without decryption, using lattice-based methods.

Fully homomorphic encryption lets you compute on encrypted data, with results encrypted and privacy preserved in cloud analytics; it relies on lattice-based polynomials and is prototyped by Microsoft and IBM.

Surging quantum threats demand post-quantum cryptography adoption, guided by NIST standards, with crypto agility enabling rapid algorithm swaps across systems.