This talk presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, at a 2^128 security level, these algorithms achieve a reciprocal decryption throughput of just 60493 cycles (plus cipher cost etc.) on a single Ivy Bridge core. These algorithms rely on an additive FFT for fast root computation, a transposed additive FFT for fast syndrome computation, and a sorting network to avoid cache-timing attacks. This is joint work with Tung Chou (Technische Universiteit Eindhoven) and Peter Schwabe (Radboud Universiteit Nijmegen).