Why quantum computers break this: Shor's algorithm

The same module told visually, ready to present. Speaker notes carry the full explanation.

The bridge

Shor's algorithm

Why everything above is called classical, and what a quantum computer would do to it

Classical (GNFS)Sub-exponential in key sizeRSA-2048 out of reachKey sizes calibrated against itQuantum (Shor, 1994)Polynomial timeFactors n and solves discrete logsBreaks RSA, DH and ECC outrightvs
Why quantum computers break this: Shor's algorithm · Classical Crypto Today1 / 3
1 / 3

Keys: ← → move, F full screen, G all slides, N notes