Results 151 to 160 of about 661 (173)
Some of the next articles are maybe not open access.
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
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
On the Lightweight McEliece Cryptosystem for Low-Power Devices
2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), 2019In this paper we consider a problem of secured data transmission for low-power devices such as RFID (Radio Frequency IDentification) tags or some other devices for Internet of Things (IoT) for which low power consumption plays significant role. In fact, the privacy aspect involved with technology of RFID and IoT could become a major issue in the ...
Fedor I. Ivanov +2 more
openaire +1 more source
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
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
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 0020 +3 more
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: simulation and security vulnerabilities
International Journal of Computing Science and Mathematics, 2020Rakesh Kumar +3 more
openaire +1 more source
Using Low-Density Parity-Check codes to improve the McEliece cryptosystem
Information Sciences, 2020Pedro Branco +2 more
exaly