Results 31 to 40 of about 237 (172)
A Key-Recovery Side-Channel Attack on Classic McEliece Implementations
In this paper, we propose the first key-recovery side-channel attack on Classic McEliece, a KEM finalist in the NIST Post-quantum Cryptography Standardization Project.
Qian Guo +2 more
doaj +3 more sources
Compact McEliece keys based on quasi-dyadic Srivastava codes
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
Persichetti Edoardo
doaj +1 more source
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes [PDF]
In this work, we propose two McEliece variants: one from Moderate Density Parity-Check (MDPC) codes and another from quasi-cyclic MDPC codes. MDPC codes are LDPC codes of higher density (and worse error-correction capability) than what is usually adopted for telecommunication applications.
Misoczki, Rafael +3 more
openaire +3 more sources
Decoding the Tensor Product of MLD Codes and Applications for Code Cryptosystems
For the practical application of code cryptosystems such as McEliece, it is necessary that the code used in the cryptosystem should have a fast decoding algorithm.
Vladimir Mikhailovich Deundyak +2 more
doaj +1 more source
The Support Splitting Algorithm for Induced Codes
In the paper, the analysis of the stability of the McEliece-type cryptosystem on induced codes for key attacks is examined. In particular, a model is considered when the automorphism group is trivial for the base code C, on the basis of which the induced
Yury V. Kosolapov, Aleksey N. Shigaev
doaj +1 more source
Decoding algorithms for Goppa codes with errors and erasures [PDF]
In 1978, McEliece built the first public key cryptosystem based on error-correcting codes. This cryptosystem based on Goppa codes is considered promising and cryptographically stable, taking into account quantum computing.
Ratseev, Sergey Mihailovich +1 more
doaj +1 more source
Side Channels in the McEliece PKC [PDF]
The McEliece public key cryptosystem (PKC) is regarded as secure in the presence of quantum computers because no efficient quantum algorithm is known for the underlying problems, which this cryptosystem is built upon. As we show in this paper, a straightforward implementation of this system may feature several side channels.
Falko Strenzke +4 more
openaire +1 more source
Cryptanalysis of the Original McEliece Cryptosystem [PDF]
The class of public-key cryptosystems based on error-correcting codes is one of the few alternatives to the common algorithms based on number theory. We here present an attack against these systems which actually consists of a new probabilistic algorithm for finding minimum-weight words in any large linear code.
Anne Canteaut, Nicolas Sendrier
openaire +1 more source
Oblivious Transfer Based on the McEliece Assumptions [PDF]
We implement one-out-of-two bit oblivious transfer (OT) based on the assumptions used in the McEliece cryptosystem: the hardness of decoding random binary linear codes, and the difficulty of distinguishing a permuted generating matrix of Goppa codes from a random matrix. To our knowledge this is the first OT reduction to these problems only. We present
Rafael Dowsley +3 more
openaire +2 more sources
Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information
The McEliece cryptosystem is a strong contender for post-quantum schemes, including key encapsulation for confidentiality of key exchanges in network protocols.
Marcus Brinkmann +4 more
doaj +1 more source

