[147151] in cryptography@c2.net mail archive
[Cryptography] djb's McBits (with Tung Chaou and Peter Schwabe)
daemon@ATHENA.MIT.EDU (ianG)
Mon Sep 16 09:44:42 2013
X-Original-To: cryptography@metzdowd.com
Date: Mon, 16 Sep 2013 14:33:34 +0300
From: ianG <iang@iang.org>
To: cryptography@metzdowd.com
In-Reply-To: <CAHOTMVLUWgH-AsBGDJ_vhvX+hnAuTw0SoeaAPTXAgcaUEMo_RA@mail.gmail.com>
Cc: Tony Arcieri <bascule@gmail.com>
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
On 15/09/13 07:17 AM, Tony Arcieri wrote:
> ... djb is
> working on McBits.
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.
CHES 2013 was late August, already. Was anyone there? Any comments on
McBits?
(skimming paper reveals one gotcha -- huge keys, 64k for 2^80 security.
I'm guessing that FFT==fast fourier transform.)
iang
Slides:
http://cr.yp.to/talks/2013.06.12/slides-djb-20130612-a4.pdf
Paper:
http://binary.cr.yp.to/mcbits-20130616.pdf
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
