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
Journal ArticleDOI
RFID Authentication Protocols Based on Error-Correcting Codes: A Survey
TL;DR: A survey on various and recent authentication protocols in radio frequency identification systems which use diverse variants of the McEliece cryptosystem and discusses the security and the performance of each presented protocol.
Book ChapterDOI
Polynomial Structures in Code-Based Cryptography
TL;DR: A probability problem applied in the code based cryptography related to the shape of the polynomials with exactly t different roots, it is shown that the structure is very dense and the probability that this type of polynomial has at least one coefficient equal to zero is extremelly low.
Book
Cryptographic hardware and embedded systems : CHES 2009 : 11th international workshop, Lausanne, Switzerland, September 6-9, 2009 : proceedings
Christophe Clavier,Kris Gaj +1 more
TL;DR: Software Implementations.
Journal ArticleDOI
Development of crypto-code constructs based on LDPC codes
Serhii Pohasii,Serhii Yevseiev,O. S. Zhuchenko,Oleksandr Milov,Volodymyr Lysechko,Oleksandr Kovalenko,Maryna Kostiak,Andrii Volkov,Aleksandr Lezik,Vitalii Susukailo +9 more
TL;DR: The results of developing post-quantum algorithms of McEliece and Niederreiter crypto-code constructs based on LDPC (Low-Density Parity-Check) codes are presented, which provide the required level of security services in a full-scale quantum computer.
Posted Content
An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the Standard Model
TL;DR: In this paper, the authors proposed an efficient chosen-ciphertext secure (CCA2-secure) variant of the McEliece public-key encryption (PKE) scheme in the standard model.
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.