The Miller-Rabin Primality Test
The probabilistic primality test from the work of Miller and Rabin in the 1970s, its role in generating cryptographic keys, and its error bounds.
5 posts about cryptography
The probabilistic primality test from the work of Miller and Rabin in the 1970s, its role in generating cryptographic keys, and its error bounds.
From classical ciphers to the public-key breakthrough and TLS securing commerce, and the coming post-quantum transition.
For most of history, encryption meant two people sharing one secret key, which raised an awkward question: how do you share the key safely in the first place? A breakthrough in the 1970s solved it, and that solution quietly makes the modern internet possible.
A comprehensive technical reference on WebAuthn and passkeys, explaining the cryptographic mechanisms, history, implementation trade-offs, and strategic considerations for engineers and technical leaders.
The hash tree that lets systems verify large data with small proofs, patented by Ralph Merkle in 1979, and its role in Git, backups, and blockchains.