McBits : Fast constant-time code-based cryptography

D.J. Bernstein, T. Chou, P. Schwabe

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

41 Citations (Scopus)
2 Downloads (Pure)

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
Original languageEnglish
Title of host publicationCryptographic Hardware and Embedded Systems – CHES 2013 (15th International Workshop, Santa Barbara CA, USA, August 20-23, 2013. Proceedings)
EditorsG. Bertoni, J.-S. Coron
Place of PublicationBerlin
PublisherSpringer
Pages250-272
ISBN (Print)978-3-642-40348-4
DOIs
Publication statusPublished - 2013
Eventconference; 15th International Workshop on Cryptographic Hardware and Embedded Systems; 2013-08-20; 2013-08-23 -
Duration: 20 Aug 201323 Aug 2013

Publication series

NameLecture Notes in Computer Science
Volume8086
ISSN (Print)0302-9743

Conference

Conferenceconference; 15th International Workshop on Cryptographic Hardware and Embedded Systems; 2013-08-20; 2013-08-23
Period20/08/1323/08/13
Other15th International Workshop on Cryptographic Hardware and Embedded Systems

Fingerprint Dive into the research topics of 'McBits : Fast constant-time code-based cryptography'. Together they form a unique fingerprint.

Cite this