Results 201 to 210 of about 8,486 (220)

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

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

McELIECE AND NIEDERREITER CRYPTOCODE STRUCTURE MODELS

Terra security
The relevance of the research lies in ensuring information security by creating cryptographic solutions that combine high performance, resistance to quantum attacks and the possibility of effective implementation in resource-limited devices. The subject of study is the approaches and strategies for using code cryptosystems, in particular the McEliese ...
Vadym Stetsenko, Pierre Murr, Andrii Tkachov, Oleksandr Laptiev, Marharyta Melnyk   +4 more
openaire   +3 more sources

Designing a Rank Metric Based McEliece Cryptosystem

2010
In this paper we describe the rank metric based McEliece type cryptosystems which where first introduced by Gabidulin, Paramonov and Tretjakov in the 90's. Then we explain the principle of Overbeck's attack is so efficient on these types of systems.
openaire   +2 more sources

The McEliece and Niederreiter Cryptosystems

2014
This chapter is devoted to the McEliece and Niederreiter cryptosystems, which are the first and best known examples of code-based public-key cryptosystems. The classical instances of the McEliece and Niederreiter cryptosystems are described, together with the class of Goppa codes, which are the codes originally used in these systems and which have best
openaire   +1 more source

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

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

2022
Andre Esser, Alexander May, Floyd Zweydinger   +2 more
openaire   +1 more source

High-Performance Implementations of Classic McEliece KEM on GPUs

International Symposium on Circuits and Systems
Dingyan Xu, Yiwen Gao, Yongbin Zhou, Jian Weng   +3 more
semanticscholar   +1 more source

Message-Recovery Horizontal Correlation Attack on Classic McEliece

CASCADE
Brice Colombier, Vincent Grosso, P. Cayrel, V. Dragoi   +3 more
semanticscholar   +1 more source