Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes
Pierre-Louis Cayrel,Gerhard Hoffmann,Edoardo Persichetti +2 more
- Vol. 7293, pp 138-155
Reads0
Chats0
TLDR
This paper provides secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and successively converts the scheme to a CCA2-secure protocol in the random oracle model applying the Fujisaki-Okamoto transform.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.read more
Citations
More filters
Book ChapterDOI
Group Encryption: Full Dynamicity, Message Filtering and Code-Based Instantiation
TL;DR: Group encryption (GE) is the encryption analogue of group signatures as mentioned in this paper, which allows to send verifiably encrypted messages satisfying certain requirements to certified members of a group, while keeping the anonymity of the receivers.
Journal Article
Secure Key Encapsulation Mechanism with Compact Ciphertext and Public Key from Generalized Srivastava code.
Jayashree Dey,Ratna Dutta +1 more
TL;DR: This work presents a key encapsulation mechanism (KEM) using a parity check matrix of the Generalized Srivastava code as the public key matrix that provides IND-CCASecurity in the random oracle model and can be shown to achieve post-quantum security in the quantum random oracles model.
Selected constructive and destructive approaches to post-quantum cryptography
TL;DR: The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers.
Posted Content
An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the Standard Model
TL;DR: In this article, the authors proposed an efficient CCA2-secure variant of the McEliece PKE scheme in the standard model, which can be applied to any one-way trapdoor function (OW-TDF).
Book ChapterDOI
DAGS : reloaded revisiting dyadic key encapsulation
Gustavo Banegas,Paulo S. L. M. Barreto,Brice Odilon Boidje,Pierre-Louis Cayrel,Gilbert Ndollane Dione,Kris Gaj,Cheikh Thiecoumba Gueye,Richard Haeussler,Jean Belo Klamti,Ousmane Ndiaye,Duc Tri Nguyen,Edoardo Persichetti,Jefferson E. Ricardini +12 more
TL;DR: In this paper, the DAGS key encapsulation mechanism was revisited and modified to fit an alternative KEM framework, and a new set of parameters that use binary codes were presented.
References
More filters
Book
The Theory of Error-Correcting Codes
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Journal ArticleDOI
On the inherent intractability of certain coding problems (Corresp.)
TL;DR: The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.
Book ChapterDOI
Polynomial reconstruction based cryptography
Aggelos Kiayias,Moti Yung +1 more
TL;DR: A short overview of recent works on the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) and the novel applications that were enabled due to this development.
Book
Public-Key Cryptography
TL;DR: This book gives a broad overview of public-key cryptography - its essence and advantages, various public- key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis.