Smaller keys for code-based cryptography: QC-MDPC mceliece implementations on embedded devices

  • Authors:
  • Stefan Heyse;Ingo von Maurich;Tim Güneysu

  • Affiliations:
  • Horst Görtz Institute for IT-Security, Ruhr-Universität Bochum, Bochum, Germany;Horst Görtz Institute for IT-Security, Ruhr-Universität Bochum, Bochum, Germany;Horst Görtz Institute for IT-Security, Ruhr-Universität Bochum, Bochum, Germany

  • Venue:
  • CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the last years code-based cryptosystems were established as promising alternatives for asymmetric cryptography since they base their security on well-known NP-hard problems and still show decent performance on a wide range of computing platforms. The main drawback of code-based schemes, including the popular proposals by McEliece and Niederreiter, are the large keys whose size is inherently determined by the underlying code. In a very recent approach, Misoczki et al. proposed to use quasi-cyclic MDPC (QC-MDPC) codes that allow for a very compact key representation. In this work, we investigate novel implementations of the McEliece scheme using such QC-MDPC codes tailored for embedded devices, namely a Xilinx Virtex-6 FPGA and an 8-bit AVR microcontroller. In particular, we evaluate and improve different approaches to decode QC-MDPC codes. Besides competitive performance for encryption and decryption on the FPGA, we achieved a very compact implementation on the microcontroller using only 4,800 and 9,600 bits for the public and secret key at 80 bits of equivalent symmetric security.