id: 06059177
dt: a
an: 06059177
au: Cayrel, Pierre-Louis; Hoffmann, Gerhard; Persichetti, Edoardo
ti: Efficient implementation of a CCA2-secure variant of McEliece using
    generalized Srivastava codes.
so: Fischlin, Marc (ed.) et al., Public key cryptography ‒ PKC 2012. 15th
    international conference on practice and theory in public key
    cryptography, Darmstadt, Germany, May 21‒23, 2012. Proceedings.
    Berlin: Springer (ISBN 978-3-642-30056-1/pbk). Lecture Notes in
    Computer Science 7293, 138-155 (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-30057-8_9
ab: Summary: 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.
rv: