Recent submissions

Comment · 2 years ago
Rainbow is not a KEM, but a signature scheme.
Comment · 2 years ago
> ... destroying Internet security seems like a dubious reason to build a new machine.

I can't agree with this; Destroying internet security is an excellent reason to build a new machine.

Comment · 3 years ago
Comment · 3 years ago
The Discrete Log Problem is relatively simple to explain in the context of a generic group. It's sort of intuitive that elliptic curve groups are a pretty good instance of a generic group. So I don't think it is simpler to explain the security of RSA than the security of ECC.

Additionally, the best attack on ECDLP (Pollard's rho) is much easier to understand than the best attack on RSA (the number field sieve).

Comment · 3 years ago
Comment · 3 years ago
For the cryptography & theory? https://toc.cryptobook.us/

For the design and internals of hash functions? The finalists for the SHA3 competition have extensive design documentation. There's an archive at https://web.archive.org/web/20170829225940/http://csrc.nist....

Cryptographic hash functions are designed to resist existing attacks, so you'll want an understanding of differential & linear cryptanalysis, as well as a variety of algebraic attacks. I don't know of a good textbook on the subject, so you might find yourself searching keywords on https://eprint.iacr.org/

Comment · 3 years ago
Comment · 3 years ago
Joan Daemen even lost twice in one competition! Subterranean 2.0, another Duplex, didn't make it past round 2.
Comment · 4 years ago

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton