SMS scnews item created by donnelly at Tue 29 Oct 2013 0617
Type: Seminar
Modified: Tue 29 Oct 2013 0618
Distribution: World
Expiry: 26 Nov 2013
Calendar1: 31 Oct 2013 1500
CalLoc1: Carslaw 535A
Auth: donnelly@seurat.maths.usyd.edu.au

Computational Algebra Seminar: Lange and Bernstein



This Thursday we will have two short talks.


First

   Factoring RSA keys from certified smart cards: Coppersmith in the wild

   Tanja Lange, Technische Universiteit Eindhoven

   Abstract: http://smartfacts.cr.yp.to/


Then (at 3.30pm or so)

   McBits: fast constant-time code-based cryptography

   Daniel J. Bernstein, University of Illinois at Chicago and
                        Technische Universiteit Eindhoven

   Abstract: This talk presents extremely fast algorithms for code-based
   public-key cryptography, including full protection against timing
   attacks. For example, at a 2^128 security level, these algorithms
   achieve 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. This is joint work with Tung Chou (Technische
   Universiteit Eindhoven) and Peter Schwabe (Radboud Universiteit
   Nijmegen).


If you are registered you may mark the scnews item as read.
School members may try to .