@inproceedings{cb0e81d446e741c283dc3a9b5dc71337,
title = "McBits : Fast constant-time code-based cryptography",
abstract = "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",
author = "D.J. Bernstein and T. Chou and P. Schwabe",
year = "2013",
doi = "10.1007/978-3-642-40349-1_15",
language = "English",
isbn = "978-3-642-40348-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "250--272",
editor = "G. Bertoni and J.-S. Coron",
booktitle = "Cryptographic Hardware and Embedded Systems – CHES 2013 (15th International Workshop, Santa Barbara CA, USA, August 20-23, 2013. Proceedings)",
address = "Germany",
note = "conference; 15th International Workshop on Cryptographic Hardware and Embedded Systems; 2013-08-20; 2013-08-23 ; Conference date: 20-08-2013 Through 23-08-2013",
}