Worst case QC-MDPC decoder for McEliece cryptosystem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Worst case QC-MDPC decoder for McEliece cryptosystem

Abstract

QC-MDPC-McEliece is a recent variant of the McEliece encryption scheme which enjoys relatively small key sizes as well as a security reduction to hard problems of coding theory. Furthermore, it remains secure against a quantum adversary and is very well suited to low cost implementations on embedded devices. Decoding MDPC codes is achieved with the (iterative) bit flipping algorithm, as for LDPC codes. Variable time decoders might leak some information on the code structure (that is on the sparse parity check equations) and must be avoided. A constant time decoder is easy to emulate, but its running time depends on the worst case rather than on the average case. So far implementations were focused on minimizing the average cost. We show that the tuning of the algorithm is not the same to reduce the maximal number of iterations as for reducing the average cost. This provides some indications on how to engineer the QC-MDPC-McEliece scheme to resist a timing side-channel attack.
Fichier principal
Vignette du fichier
isit_2016.pdf (195.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01408633 , version 1 (05-12-2016)

Identifiers

Cite

Julia Chaulet, Nicolas Sendrier. Worst case QC-MDPC decoder for McEliece cryptosystem. IEEE International Symposium on Information Theory, ISIT 2016, Jul 2016, Barcelone, Spain. pp.5, ⟨10.1109/ISIT.2016.7541522⟩. ⟨hal-01408633⟩

Collections

INRIA INRIA2
135 View
185 Download

Altmetric

Share

Gmail Facebook X LinkedIn More