[Cryptography] djb's McBits (with Tung Chaou and Peter Schwabe)

ianG iang at iang.org
Mon Sep 16 07:33:34 EDT 2013

On 15/09/13 07:17 AM, Tony Arcieri wrote:
> ... djb is
> working on McBits.

McBits: fast constant-time code-based cryptography

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.

CHES 2013 was late August, already.  Was anyone there?  Any comments on 

(skimming paper reveals one gotcha -- huge keys, 64k for 2^80 security. 
  I'm guessing that FFT==fast fourier transform.)



More information about the cryptography mailing list