Results 171 to 180 of about 2,437 (198)
Some of the next articles are maybe not open access.
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
About one structural attack on McEliece cryptosystem
2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2016In this paper an attack on McEliece cryptosystem is considered. In this system the private and public keys are generator matrices of equivalent codes, i.e. they differ by fixed (secret) permutation. At the same time it is known that for every code there are the group of permutations preserving the code. Such code's structure may be used for analysis of
Evgenii Krouk, Andrei Ovchinnikov
openaire +1 more source
An implementation of the McEliece-cryptosystem
ACM SIGSAC Review, 1991Most 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
The key space of the McEliece–Sidelnikov cryptosystem
Discrete Mathematics and Applications, 2009Summary: 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, 2011the 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 +3 more
openaire +1 more source
McEliece cryptosystem: simulation and security vulnerabilities
International Journal of Computing Science and Mathematics, 2020Rakesh Kumar +3 more
openaire +1 more source
Cryptanalysis of McEliece public key cryptosystem
2020oz McELIECE AÇIK ANAHTARLI KRIPTOSISTEMININ KRİPTOANALİZİ Bıçak. Ali Yüksek Lisans, Matematik Bölümü Tez Yöneticisi: Prof. Dr. İsmail Ş. Güloğlu Eylül 1998, 106 sayfa Bu çalışmada McEliece açık-anahtarlı kriptosistemi üzerine yapılan atak ları inceledik ve sistemin bu ataklara karşı güvenilirliğini araştırdık.
openaire +1 more source