Results 61 to 70 of about 86 (81)
LDPC Codes in the McEliece Cryptosystem: Attacks and Countermeasures
, 2009 The McEliece cryptosystem is a public-key cryptosystem based on coding theory that has successfully resisted cryptanalysis for thirty years. The original version, based on Goppa codes, is able to guarantee a high level of security, and is faster than competing solutions, like RSA.
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
McEliece public key cryptosystems using algebraic-geometric codes
Proceedings of 1995 IEEE International Symposium on Information Theory, 1996In the McEliece public key cryptosystem, a user \(A\) chooses a \(k\times n\) binary generator matrix \(G_A\) of a \(t\)-error correcting binary linear code and publishes the matrix \(G'_A= SG_AP\), where \(P\) is a randomly generated \(k\times k\) non-singular binary matrix and \(P\) is an \(n\times n\) permutation matrix. For a user to send message \(
Janwa, Heeralal, Moreno, Oscar
openaire +1 more source
Quantum McEliece public-key cryptosystem
Quantum Information and Computation, 2012The 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
Modification and Software Implementation of Mceliece Cryptosystem
2021This article addresses issues related to the modification of the McEliece cryptosystem. The software development presented in this article is crypto stability, the original McEliece algorithm is post-quantum, unlike its counterparts. The theoretical description of the McEliece cryptosystem was considered.
Anna Krutko +6 more
openaire +1 more source
Joint Twin-Field-QKD-McEliece Cryptosystem
OSA Advanced Photonics Congress (AP) 2020 (IPR, NP, NOMA, Networks, PVLED, PSC, SPPCom, SOF), 2020To overcome rate-distance-limit of QKD protocols, we propose a joint TF-QKD-McEliece scheme in which TF-QKD is used for raw-key transmission while McEliece-cryptosystem to transmit parity bits for information reconciliation. Proposed scheme is able to achieve record distance of 1127 km, thus significantly outperforming TF-QKD schemes.
openaire +1 more source
New Variant of the McEliece Cryptosystem
2015The 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
Designing a Rank Metric Based McEliece Cryptosystem
2010In 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
McEliece Cryptosystem Implementation: Theory and Practice
2008Though 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
The McEliece and Niederreiter Cryptosystems
2014This 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