Results 141 to 150 of about 237 (172)

New Variant of the McEliece Cryptosystem

2015
The purpose of this paper is to present a new version of the McEliece cryptosystem based on punctured convolutional codes and the pseudo-random generators. We use the modified self-shrinking generator to fill the punctured pattern. More precisely we propose to fill out the pattern punctured by the bits generated using a pseudo random generator LFSR.
Hamza Moufek, Kenza Guenda
openaire   +1 more source

The Mceliece System

1988
In this chapter it is assumed that the reader is familiar with algebraic coding theory. A reader without this background can freely skip this chapter and continue with Chapter 11. From [Mac77] we recall the following facts about Goppa codes. With each irreducible polynomial of degree tover GF(2 m ) corresponds a binary, irreducible Goppa code of ...
openaire   +1 more source

Classic McEliece

2017
The first code-based public-key cryptosystem was introduced in 1978 by McEliece. The public key specifies a random binary Goppa code. A ciphertext is a codeword plus random errors. The private key allows efficient decoding: extracting the codeword from the ciphertext, identifying and removing the errors.The McEliece system was designed to be one-way ...
Bernstein, Daniel J., Chou, Tung, Lange, Tanja, von Maurich, Ingo, Misoczki, Rafael, Niederhagen, Ruben, Persichetti, Edoardo, Peters, Christiane, Schwabe, Peter, Sendrier, Nicolas, Szefer, Jakub, Wang, Wen   +11 more
openaire   +1 more source

Zero-Knowledge Protocols for the McEliece Encryption

2012
We present two zero-knowledge protocols for the code-based McEliece public key encryption scheme in the standard model. Consider a prover who encrypted a plaintext m into a ciphertext c under the public key pk. The first protocol is a proof of plaintext knowledge (PPK), where the prover convinces a polynomially bounded verifier on a joint input (c,pk ...
Kirill Morozov, Tsuyoshi Takagi
openaire   +1 more source

An implementation of the McEliece-cryptosystem

ACM SIGSAC Review, 1991
Most asymmetric cryptosystems are based on hard number-theoretic problems such as integer factorization or taking discrete logarithms in finite groups [2]. Their performance aspect are well investigated [3].
openaire   +2 more sources

McEliece Cryptosystem Implementation: Theory and Practice

2008
Though it is old and considered fast, the implementation of McEliece public-key encryption scheme has never been thoroughly studied. We consider that problem here and we provide an implementation with a complete description of our algorithmic choices and parameters selection, together with the state of the art in cryptanalysis.
Bhaskar Biswas, Nicolas Sendrier
openaire   +1 more source

Quantum McEliece public-key cryptosystem

Quantum Information and Computation, 2012
The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantum McEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and ...
openaire   +1 more source

The key space of the McEliece–Sidelnikov cryptosystem

Discrete Mathematics and Applications, 2009
Summary: The McEliece cryptosystem is one of the oldest public-key cryptosystems. It was proposed by R. J. McEliece in 1978. The McEliece cryptosystem is based on a certain NP-hard problem in coding theory. In this paper we consider a generalisation of the McEliece cryptosystem proposed by V. M. Sidelnikov in 1994.
openaire   +2 more sources

Using Low-Density Parity-Check codes to improve the McEliece cryptosystem

Information Sciences, 2020
Pedro Branco, Paulo Mateus, C E R C Salema   +2 more
exaly  

McEliece Needs a Break – Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD

2022
Andre Esser 0001, Alexander May 0001, Floyd Zweydinger   +2 more
openaire   +2 more sources