McBits: Fast Constant-Time Code-Based Cryptography

  • Daniel J. Bernstein
  • Tung Chou
  • Peter Schwabe
Conference paper

DOI: 10.1007/978-3-642-40349-1_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8086)
Cite this paper as:
Bernstein D.J., Chou T., Schwabe P. (2013) McBits: Fast Constant-Time Code-Based Cryptography. In: Bertoni G., Coron JS. (eds) Cryptographic Hardware and Embedded Systems - CHES 2013. CHES 2013. Lecture Notes in Computer Science, vol 8086. Springer, Berlin, Heidelberg

Abstract

This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, at a 2128 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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Daniel J. Bernstein
    • 1
    • 2
  • Tung Chou
    • 2
  • Peter Schwabe
    • 3
  1. 1.Department of Computer ScienceUniversity of Illinois at ChicagoChicagoUSA
  2. 2.Department of Mathematics and Computer ScienceTechnische Universiteit EindhovenEindhovenThe Netherlands
  3. 3.Digital Security GroupRadboud University NijmegenNijmegenThe Netherlands

Personalised recommendations