Educational security & quantum computing demo
Shor's Algorithmvs RSA
A hands-on exploration of how quantum computing challenges RSA encryption, from classical number theory to period-finding, circuits and real hardware validation.
Why is RSA secure against classical computers, and why would a sufficiently capable quantum computer change that?
> Backend connected -- Houdini finally got through, and a very patient alien is relaying a signal from someone currently invisible to the one who can actually see it arrive.
connecting… (free-tier hosting sleeps when idle -- first load can take up to a minute)
Live, real API call every time — not a recording. See Shor's Lab to run it yourself with any supported N.
// what the QFT step is doingLive
This is a real Dirichlet kernel, the same sum of amplitudes the quantum Fourier transform produces: it nearly cancels out everywhere except at multiples of the period r. That's why measuring afterward almost always lands near a multiple of N/r -- the one signal the rest of the algorithm needs. See QFT & Period-Finding for the full explanation and a from-scratch check against the exact math.
Project stats (from this repository)
Start here
The harbour connects. The algorithm transforms.
Care · Rigour · Curiosity