Results 151 to 160 of about 11,917 (171)

Weak Keys in the McEliece Public-Key Cryptosystem [PDF]

IEEE Transactions on Information Theory, 2001
Summary: We show that it is possible to know whether the secret Goppa code of an instance of the McEliece public-key cryptosystem was chosen with a binary generator polynomial. Furthermore, whenever such a weak key is used, we present an attack which can be completed, for codes of length 1024 and dimension 524, with a large, but feasible amount of ...
Pierre Loidreau, Nicolas Sendrier
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Lightweight McEliece Cryptosystem for Low-Power Devices

2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), 2019
In 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, Evgenii Krouk, Alexey Kreshchuk   +2 more
openaire   +2 more sources

Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack

Lecture Notes in Computer Science, 1997
: The McEliece public-key cryptosystem fails to protect any message which is sent to a recipient more than once using different random error vectors. In general, it fails to protect any messages sent to a recipient which have a known linear relation to ...
Thomas A. Berson
exaly   +1 more source

The Number of Public Keys in the McEliece-Sidel’nikov Cryptosystem

Moscow University Computational Mathematics and Cybernetics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +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

McEliece cryptosystem: simulation and security vulnerabilities

International Journal of Computing Science and Mathematics, 2020
Rakesh Kumar, Allu Swamy Naidu, Ajeet Singh, Appala Naidu Tentu   +3 more
openaire   +2 more sources

UC Analysis of the Randomized McEliece Cryptosystem

2022
openaire   +2 more sources

Using Low-Density Parity-Check Codes to Improve the McEliece Cryptosystem

Information Sciences, 2020
André Souto, Paulo Mateus, Carlos Salema   +2 more
exaly  

A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes

Lecture Notes in Computer Science, 2008
Franco Chiaraluce, Marco Baldi
exaly  

Enhanced Public Key Security for the McEliece Cryptosystem

Journal of Cryptology, 2016
Franco Chiaraluce, Marco Baldi, Joachim Rosenthal   +2 more
exaly