Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes

  • Authors:
  • Pierre-Louis Cayrel;Gerhard Hoffmann;Edoardo Persichetti

  • Affiliations:
  • Université Jean Monnet, Saint-Etienne, France;Technische Universität Darmstadt, Germany;University of Auckland, New Zealand

  • Venue:
  • PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and successively convert our scheme to a CCA2-secure protocol in the random oracle model applying the Fujisaki-Okamoto transform. In contrast with all other CCA2-secure code-based cryptosystems that work in the random oracle model, our conversion does not require a constant weight encoding function. We present results for both 128-bit and 80-bit security level, and for the latter we also feature an implementation for an embedded device.