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

Pierre-Louis Cayrel (1) , Gerhard Hoffmann (2) , Edoardo Persichetti (3)

1 LHC - Laboratoire Hubert Curien [Saint Etienne]
2 CASED - Center for Advanced Security Research Darmstadt [Darmstadt]
3 University of Auckland [Auckland]

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.

Domains: Computer Science [cs]; Cryptography and Security [cs.CR]

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⟩