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 Article
Secure integration of asymmetric and symmetric encryption schemes
TL;DR: This conversion is the first generic transformation from an arbitrary one-way asymmetricryption scheme to a chosen-ciphertext secure asymmetric encryption scheme in the random oracle model.
Book
Advances in cryptology -- EUROCRYPT 2010 : 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30-June 3, 2010 : proceedings
TL;DR: Cryptosystems I and II: Cryptography between Wonderland and Underland as discussed by the authors, a simple BGN-type Cryptosystem from LWE, or Bonsai Trees, or how to delegate a Lattice Basis.
Journal ArticleDOI
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks
TL;DR: Current state of the art on post-quantum cryptosystems and how they can be applied to blockchains and DLTs are studied, as well as their main challenges.
BIKE: Bit Flipping Key Encapsulation
Nicolas Aragon,Paulo S. L. M. Barreto,Slim Bettaieb,Loïc Bidoux,Olivier Blazy,Jean-Christophe Deneuville,Philippe Gaborit,Shay Gueron,Tim Güneysu,Carlos Aguilar Melchor,Rafael Misoczki,Edoardo Persichetti,Nicolas Sendrier,Jean-Pierre Tillich,Gilles Zémor +14 more
TL;DR: HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not, for teaching and research institutions in France or abroad, or from public or private research centers.
Journal ArticleDOI
From Pre-Quantum to Post-Quantum IoT Security: A Survey on Quantum-Resistant Cryptosystems for the Internet of Things
TL;DR: A survey on what can be called post-quantum IoT systems (IoT systems protected from the currently known quantum computing attacks): the main post-Quantum cryptosystems and initiatives are reviewed, the most relevant IoT architectures and challenges are analyzed, and the expected future trends are indicated.
References
More filters
Journal ArticleDOI
Factoring polynomials over finite fields
TL;DR: The method reduces the factorization of a polynomial of degree m over GF(q) to the solution of about m(q − 1)/q linear equations in as many unknowns over GF (q).
Book ChapterDOI
Attacking and Defending the McEliece Cryptosystem
TL;DR: New parameters for the McEliece and Niederreiter cryptosystems achieving standard levels of security against all known attacks are proposed, and the resulting public-key sizes are considerably smaller than previous parameter choices for the same level of security.
Posted Content
Attacking and defending the McEliece cryptosystem
TL;DR: In this article, the authors presented several improvements to Stern's attack on the McEliece cryptosystem and achieved results considerably better than Canteaut et al. This attack has been implemented and is now in progress.
Book ChapterDOI
Multi-query computationally-private information retrieval with constant communication rate
TL;DR: This work gives an information-theoretic lower bound on the communication of any multi-query information retrieval protocol and designs an efficient non-trivial multi- query CPIR protocol that matches this lower bound.