McBits: fast constant-time code-based cryptography
- LecturerDr. Tung Chou (Technical University of Eindhoven)
Host: Bo-Yin Yang - Time2013-04-17 (Wed.) 15:00 ~ 16:00
- LocationAuditorium 106 at new IIS Building
Abstract
This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, this paper achieves a reciprocal throughput of just 36615 cycles per decryption at a $2^{80}$ security level 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.