Results 141 to 150 of about 11,917 (171)

Differential Power Analysis of a McEliece Cryptosystem [PDF]

Lecture Notes in Computer Science, 2015
This work presents the first differential power analysis of an implementation of the McEliece cryptosystem. Target of this side-channel attack is a state-of-the-art FPGA implementation of the efficient QC-MDPC McEliece decryption operation as presented at DATE 2014.
Thomas Eisenbarth, Ingo Von Maurich
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

McEliece Cryptosystem Implementation: Theory and Practice

Lecture Notes in Computer Science, 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.
Nicolas Sendrier
exaly   +3 more sources

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

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

On the design and security of Lee metric McEliece cryptosystems

Designs, Codes and Cryptography, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Terry Shue Chien Lau, Chik How Tan
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   +2 more sources

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

Key Privacy in McEliece Public Key Cryptosystem

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, 2011
the research on the anonymity of original McEliece PKC points out that the original McEliece PKC fails to hold the property of key privacy. A novel semantically secure variant of McEliece PKC is proposed, and proved its anonymity formally in standard model.
Qiang Wang 0020, Xue Qiu, Quan Zhang, Chaojing Tang   +3 more
openaire   +1 more source

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

Further Cryptanalysis of the McEliece Public-Key Cryptosystem

IEEE Communications Letters, 2000
We further analyze the security of the McEliece (1978) public-key cryptosystem according to the notions of public-key encryption security. We show that the McEliece scheme is insecure against adaptive chosen-ciphertext attacks. In addition, we also point out that the McEliece scheme does not satisfy the nonmalleability property.
exaly   +3 more sources