Results 11 to 20 of about 661 (173)
Variations of the McEliece Cryptosystem [PDF]
, 2017 Two variations of the McEliece cryptosystem are presented. The first is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is done in such a way that the Hamming weight of the error, added in the encryption process, can be controlled so that efficient decryption remains possible.
Bolkema, Jessalyn +5 more
openaire +4 more sources
EFFECTIVE IMPLEMENTATION OF MODERN MCELIECE CRYPTOSYSTEM ON GENERALIZED (L, G)-CODES [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper presents the study of methods and approaches to implementation of the modern McEliece cryptosystem based on separable generalized (L, G)-codes. Method.
Ivan K. Noskov, Sergey V. Bezzateev
doaj +2 more sources
Attacking and Defending the McEliece Cryptosystem [PDF]
, 2008 This paper presents several improvements to Stern’s attack on the McEliece cryptosystem and achieves results considerably better than Canteaut et al. This paper shows that the system with the originally proposed parameters can be broken in just 1400 days by a single 2.4GHz Core 2 Quad CPU, or 7 days by a cluster of 200 CPUs.
Bernstein, D.J., Lange, T., Peters, C.P.
core +5 more sources
A CCA2 Secure Variant of the McEliece Cryptosystem [PDF]
IEEE Transactions on Information Theory, 2012 The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems based on number-theoretical problems. Differently from RSA and ElGa- mal, McEliece PKC is not known to be broken by a quantum computer. Moreover, even tough McEliece PKC has a relatively big key size, encryption and decryption operations are rather ...
Nico Döttling +3 more
openaire +5 more sources
On Decoding Schemes for the MDPC-McEliece Cryptosystem [PDF]
CoRR, 2018 Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on other code families. In this paper, classical (iterative) decoding schemes for MPDC codes are considered.
Bartz, Hannes, Liva, Gianluigi
openaire +4 more sources
Differential Power Analysis of a McEliece Cryptosystem [PDF]
, 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.
Cong Chen 0001 +3 more
openaire +4 more sources
ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM
Prikladnaya Diskretnaya Matematika, 2019 Summary: The security of currently used asymmetric cryptosystems is based on the problems of discrete logarithm or discrete factorization. These problems can be effectively solved using Shor's algorithm on quantum computers. An alternative to such cryptosystems can be the McEliece cryptosystem. Its security is based on the problem of decoding a general
Kosolapov, Y. V., Turchenko, O. Y.
openaire +5 more sources
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 +3 more sources
A novel attack on McEliece's cryptosystem
International Journal of Computer Mathematics: Computer Systems Theory, 2023 Siamak F Shahandashti +1 more
exaly +3 more sources
On McEliece-Type Cryptosystems Using Self-Dual Codes With Large Minimum Weight
IEEE Access, 2023 One of the Round 3 Finalists in the NIST post-quantum cryptography call is the Classic McEliece cryptosystem. Although it is one of the most secure cryptosystems, the large size of its public key remains a practical limitation. In this work, we propose a
Luca Mariot +2 more
doaj +1 more source