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. © 2012 International Association for Cryptologic Research.
Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes / Cayrel, P. -L.; Hoffmann, G.; Persichetti, E.. - (2012), pp. 138-155. - LECTURE NOTES IN COMPUTER SCIENCE. [10.1007/978-3-642-30057-8_9].
Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes
Persichetti E.
2012
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. © 2012 International Association for Cryptologic Research.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.