Open Access
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
Reads0
Chats0
TLDR
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.Abstract:
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. BIKE: Bit Flipping Key Encapsulation Nicolas Aragon, Paulo Barreto, Slim Bettaieb, Loïc Bidoux, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Shay Gueron, Tim Guneysu, Carlos Aguilar Melchor, et al.read more
Citations
More filters
Posted Content
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
TL;DR: In this article, the authors proposed a 2-round OT extension protocol for secure NISC with silent preprocessing, which is the first protocol for non-interactive secure computation with noninteractive preprocessing.
Proceedings ArticleDOI
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation
TL;DR: This work addresses the problem of securely generating useful instances of two-party correlations, such as many independent copies of a random oblivious transfer (OT) correlation, using a small amount of communication, and obtains the first concretely efficient 2-round protocols for generating useful correlations, including OT correlations, in the semi-honest security model.
Book ChapterDOI
Tighter proofs of CCA security in the quantum random oracle model
TL;DR: An improved reduction for the security of the Hofheinz, Hovelmanns, and Kiltz (TCC’17) transform is improved which turns OW-CPA secure deterministic PKEs into IND-CCA secure KEMs.
Posted Content
Prototyping post-quantum and hybrid key exchange and authentication in TLS and SSH.
TL;DR: This paper explores how two major Internet security protocols, the Transport Layer Security (TLS) and Secure Shell (SSH) protocols, can be adapted to use post-quantum cryptography, and examines various design considerations for integrating post- quantum cryptography and hybrid authentication into communications protocols generally, and in TLS and SSH specifically.
Book ChapterDOI
LEDAkem: A Post-quantum Key Encapsulation Mechanism Based on QC-LDPC Codes
TL;DR: This work presents a new code-based key encapsulation mechanism (KEM) called LEDAkem, built on the Niederreiter cryptosystem and relies on quasi-cyclic low-density parity-check codes as secret codes, providing high decoding speeds and compact keypairs.
References
More filters
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Proceedings ArticleDOI
A fast quantum mechanical algorithm for database search
TL;DR: In this paper, it was shown that a quantum mechanical computer can solve integer factorization problem in a finite power of O(log n) time, where n is the number of elements in a given integer.
Book ChapterDOI
Linear cryptanalysis method for DES cipher
TL;DR: A new method is introduced for cryptanalysis of DES cipher, which is essentially a known-plaintext attack, that is applicable to an only-ciphertext attack in certain situations.
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.
Journal ArticleDOI
Speeding the Pollard and elliptic curve methods of factorization
TL;DR: In this paper, a parametrization of elliptic curves is proposed to speed up the p 1 and Monte Carlo methods. But the parametrized elliptic curve method requires n/2 + o(n) multiplications.