Open AccessPosted Content
Compact McEliece keys based on Quasi-Dyadic Srivastava codes.
Reads0
Chats0
TLDR
This paper introduces a construction based on Generalized Srivastava codes, a large class which includes Goppa codes as a special case, that allows relatively short public keys without being vulnerable to known structural attacks.Abstract:
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the public key size. Previous proposals tried to replace the class of Goppa codes with other families of codes, but this was revealed to be an insecure choice. In this paper we introduce a construction based on Generalized Srivastava codes, a large class which includes Goppa codes as a special case, that allows relatively short public keys without being vulnerable to known structural attacks.read more
Citations
More filters
Book ChapterDOI
Smaller keys for code-based cryptography: QC-MDPC mceliece implementations on embedded devices
TL;DR: In this paper, an implementation of the McEliece scheme using quasi-cyclic MDPC codes tailored for embedded devices, namely a Xilinx Virtex-6 FPGA and an 8-bit AVR microcontroller, is presented.
Μετακβαντικοί κρυπτογραφικοί αλγόριθμοι (Post-Quantum Cryptography)
TL;DR: This document breaches copyright and should be removed from access immediately, and the authors will remove access to the work immediately and investigate the claim.
Proceedings ArticleDOI
Lightweight code-based cryptography: QC-MDPC McEliece encryption on reconfigurable devices
Ingo von Maurich,Tim Güneysu +1 more
TL;DR: This work focuses on lightweight implementations of code-based cryptography and demonstrates that McEliece encryption using QC-MDPC codes can be implemented with a significantly smaller resource footprint - still achieving reasonable performance sufficient for many applications, e.g., challenge-response protocols or hybrid firmware encryption.
Proceedings ArticleDOI
Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism
TL;DR: A generic construction of AKE protocols from OW-CCA secure KEMs is proposed and CK+ security of the protocols in the random oracle model is proved and communication costs are reduced.
Book ChapterDOI
Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes
TL;DR: 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.
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.
Book ChapterDOI
A method for finding codewords of small weight
Jacques Stern,Jacques Stern +1 more
TL;DR: A probabilistic algorithm can be used to discover words of small weight in a linear binary code, which is asymptotically quite large but can be applied for codes of a medium size.
Journal ArticleDOI
Determinants of block matrices
TL;DR: In this paper, the authors consider the 2 x 2 matrices and their sum and product are given by Here the entries a, b, c, d, e, f, g, h can come from a field such as the real numbers, or more generally from a ring, commutative or not.
Book ChapterDOI
An observation on the security of McEliece's public-key cryptosystem
P. J. Lee,Ernest F. Brickell +1 more
TL;DR: A systematic method of checking is suggested, and a generalized version of the cryptanalytic attack which reduces the work factor sigdicantly is described, which can be viewed as generalized probabilistic decoding algorithms for any linear error correcting codes.
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.