Results 11 to 20 of about 11,917 (171)

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, Gluesing-Luerssen, Heide, Kelley, Christine A, Lauter, Kristin E, Malmskog, Beth, Rosenthal, Joachim   +5 more
openaire   +5 more sources

A new code‐based digital signature based on the McEliece cryptosystem

IET Communications, 2023
Digital signature schemes are used for the authentication and verification of signatures. The Courtois–Finiasz–Sendrier (CFS) digital signature is a well‐known code‐based digital signature scheme based on the Niederreiter cryptosystem. However, it is not
Farshid Haidary Makoui, Thomas Aaron Gulliver, Mohammad Dakhilalian   +2 more
doaj   +2 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, Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento   +3 more
openaire   +6 more sources

THE McELIECE CRYPTOSYSTEM WITH ARRAY CODES

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2011
Public-key cryptosystems form an important part of cryptography. In these systems, every user has a public and a private key. The public key allows other users to encrypt messages, which can only be decoded using the secret private key.
Vedat Şiap
doaj   +4 more sources

ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM [PDF]

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   +4 more sources

A McEliece cryptosystem using permutation codes

Journal of Mathematical Cryptology
This paper is an attempt to build a new public-key cryptosystem, similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes.
Srinivasan Adarsh, Mahalanobis Ayan
doaj   +4 more sources

An Efficient Decoding of Goppa Codes for the McEliece Cryptosystem

Fundamenta Informaticae, 2014
The McEliece cryptosystem is defined using a Goppa code, and decoding the Goppa code is a crucial step of its decryption. Patterson's decoding algorithm is the best known algorithm for decoding Goppa codes. Currently, the most efficient implementation of Patterson's algorithm uses a precomputation.
Seongan Lim, Hyang-Sook Lee, Mijin Choi
openaire   +3 more sources

A Summary of McEliece-Type Cryptosystems and their Security [PDF]

Journal of Mathematical Cryptology, 2007
In this paper we give an overview of some of the cryptographic applications which were derived from the proposal of R. J. McEliece to use error correcting codes for cryptographic purposes.
Engelbert D., Overbeck R., Schmidt A.
doaj   +5 more sources

Secure and Compact: A New Variant of McEliece Cryptosystem

IEEE Access
This paper introduces a variant of the McEliece cryptosystem and employs the $(C_{1}, C_{1} + C_{2})$ -construction to generate a new code from two arbitrary linear codes. We propose an efficient hard-decision decoding algorithm for linear codes derived
Ekta Bindal, Abhay Kumar Singh
doaj   +3 more sources

A Distinguisher for High-Rate McEliece Cryptosystems [PDF]

IEEE Transactions on Information Theory, 2011
The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. The hardness of this problem is an assumption to prove the security of code-based cryptographic primitives such as McEliece's cryptosystem. Up to now, it is widely believed that the GD problem is a hard decision problem. We present the
Faugère, Jean-Charles, Gauthier-Umana, Valérie, Otmani, Ayoub, Perret, Ludovic, Tillich, Jean-Pierre   +4 more
openaire   +3 more sources