Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes

(1) , (2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
2012_PKC_cayrel.pdf (167.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ujm-00712875 , version 1 (28-06-2012)

Identifiers

  • HAL Id : ujm-00712875 , version 1

Cite

Pierre-Louis Cayrel, Gerhard Hoffmann, Edoardo Persichetti. Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes. The 15th IACR International Conference on Practice and Theory of Public-Key Cryptography - PKC 2012, May 2012, Darmstadt, Germany. pp.138-155. ⟨ujm-00712875⟩
136 View
475 Download

Share

Gmail Facebook Twitter LinkedIn More