Simple RSA Lab

Toy RSA lab

Session 3: check students' key cards, then try the extension primes
n = p × q
φ = (p − 1)(q − 1)
Private d
Ciphertext me mod n
Decrypted cd mod n

Letters as numbers: A = 1 … Z = 26. With the toy key (e, n) = (3, 33), H = 8 encrypts to 17, and d = 7 brings it back.

.cf-tool.cf-tool{box-sizing:border-box;max-width:1152px;margin:0 auto;padding:28px 32px;border-radius:14px;background:#1C1B19;color:#F6F3EC;font-family:'Public Sans',system-ui,-apple-system,'Segoe UI',Roboto,sans-serif;font-size:17px;line-height:1.5;display:flex;flex-direction:column;gap:20px;text-align:left} .cf-tool.cf-tool *{box-sizing:border-box} .cf-tool.cf-tool h3{margin:0;padding:0;font-family:'Fraunces',Georgia,serif;font-size:30px;font-weight:600;line-height:1.15;color:#F6F3EC;letter-spacing:0;text-transform:none} .cf-tool.cf-tool p{margin:0} .cf-tool output{color:inherit} .cf-tool.cf-tool label{margin:0;font-weight:400;color:inherit} .cf-tool.cf-tool sup{font-size:.75em;line-height:0;vertical-align:super} .cf-tool .cf-head{display:flex;flex-wrap:wrap;justify-content:space-between;align-items:baseline;gap:8px} .cf-tool .cf-sub,.cf-tool .cf-note{font-size:15px;color:#D9D3C7} .cf-tool .cf-label{font-size:14px;color:#D9D3C7} .cf-tool .cf-label.cf-peach,.cf-tool .cf-note.cf-peach,.cf-tool .cf-peach{color:#F2B880} .cf-tool .cf-col{display:flex;flex-direction:column;gap:6px} .cf-tool.cf-tool input[type=number]{width:100%;max-width:none;height:auto;min-height:48px;margin:0;padding:0 12px;border-radius:8px;border:1px solid #5A5650;background:#2A2926;color:#F6F3EC;font-family:'IBM Plex Mono',ui-monospace,Menlo,Consolas,monospace;font-size:18px;line-height:1.2;box-shadow:none} .cf-tool.cf-tool input[type=number].cf-secret{border:1.5px solid #F2B880} .cf-tool.cf-tool input[type=number]:focus{outline:2px solid #F2B880;outline-offset:1px;border-color:#F2B880} .cf-rsa .cf-inputs{display:grid;grid-template-columns:repeat(auto-fit,minmax(min(150px,100%),1fr));gap:14px} .cf-rsa .cf-cards{display:grid;grid-template-columns:repeat(auto-fit,minmax(min(170px,100%),1fr));gap:14px} .cf-rsa .cf-box{display:flex;flex-direction:column;gap:2px;min-width:0;padding:14px 16px;border:1px solid #5A5650;border-radius:10px} .cf-rsa .cf-box.cf-hot{border-color:#F2B880} .cf-rsa .cf-val{font-family:'IBM Plex Mono',ui-monospace,Menlo,Consolas,monospace;font-size:22px;font-weight:600;line-height:1.3;overflow-wrap:anywhere} @media (max-width:600px){.cf-tool.cf-tool{padding:22px 18px}.cf-tool.cf-tool h3{font-size:26px}} (function () { var Z = BigInt(0), ONE = BigInt(1), TWO = BigInt(2); var MAXP = BigInt(100000); function big(s) { var t = String(s).trim(); return /^[0-9]+$/.test(t) ? BigInt(t) : null; } function modpow(b, e, m) { if (m === ONE) return Z; var r = ONE; b = b % m; while (e > Z) { if (e % TWO === ONE) r = (r * b) % m; e = e / TWO; b = (b * b) % m; } return r; } function isPrime(n) { if (2 > n) return false; if (4 > n) return true; if (n % 2 === 0) return false; for (var i = 3; n >= i * i; i += 2) { if (n % i === 0) return false; } return true; } function gcd(a, b) { while (b !== Z) { var t = a % b; a = b; b = t; } return a; } function inverse(a, m) { var r0 = m, r1 = ((a % m) + m) % m, t0 = Z, t1 = ONE; while (r1 !== Z) { var qq = r0 / r1; var tmp = r0 - qq * r1; r0 = r1; r1 = tmp; tmp = t0 - qq * t1; t0 = t1; t1 = tmp; } if (r0 !== ONE) return null; return ((t0 % m) + m) % m; } var roots = document.querySelectorAll('.cf-rsa:not([data-cf-ready])'); Array.prototype.forEach.call(roots, function (root) { root.setAttribute('data-cf-ready', '1'); var q = function (k) { return root.querySelector('[data-cf="' + k + '"]'); }; ['p', 'q', 'e', 'm'].forEach(function (k) { q(k).addEventListener('input', render); }); function show(v, note) { ['n', 'phi', 'd', 'c', 'back'].forEach(function (k) { q(k).textContent = v[k] === undefined ? '—' : String(v[k]); }); q('note').textContent = note; } function render() { var p = big(q('p').value), qn = big(q('q').value), e = big(q('e').value), m = big(q('m').value); var v = {}; if (![p, qn, e, m].every(function (x) { return x !== null; })) return show(v, 'Enter whole numbers in all four boxes.'); if (p >= MAXP || qn >= MAXP) return show(v, 'Keep p and q below 100,000.'); if (!isPrime(Number(p)) || !isPrime(Number(qn))) return show(v, 'p and q must both be prime.'); if (p === qn) return show(v, 'Pick two different primes.'); var n = p * qn, phi = (p - ONE) * (qn - ONE); v.n = n; v.phi = phi; if (TWO > e || gcd(e, phi) !== ONE) return show(v, 'e shares a factor with φ (or is less than 2), so no d exists. Try another e.'); var d = inverse(e, phi); v.d = d; if (m >= n) return show(v, 'The message number must be smaller than n.'); var c = modpow(m, e, n); v.c = c; v.back = modpow(c, d, n); show(v, c === m ? 'This message encrypts to itself. That is one of the two flaws in Session 3.' : 'Check: e × d = ' + String(e * d) + ', which leaves remainder 1 when divided by φ.'); } render(); }); })();