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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal-ujm.archives-ouvertes.fr/ujm-00712875
Contributor : Pierre-Louis Cayrel <>
Submitted on : Thursday, June 28, 2012 - 2:29:59 PM
Last modification on : Wednesday, July 25, 2018 - 2:05:30 PM
Long-term archiving on : Saturday, September 29, 2012 - 2:25:41 AM

File

2012_PKC_cayrel.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ujm-00712875, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

221

Files downloads

518