This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, at a 2^128 security level, this paper achieves 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.
Keywords: McEliece; Niederreiter; CFS; bitslicing; software implementation
|Name||Lecture Notes in Computer Science|
|Conference||conference; 15th International Workshop on Cryptographic Hardware and Embedded Systems; 2013-08-20; 2013-08-23|
|Period||20/08/13 → 23/08/13|
|Other||15th International Workshop on Cryptographic Hardware and Embedded Systems|