Results 1 to 10 of about 86 (81)
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
A McEliece cryptosystem using permutation codes
Journal of Mathematical CryptologyThis 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 +3 more sources
Modern variations of McEliece and Niederreiter cryptosystems
Научно-технический вестник информационных технологий, механики и оптики, 2022 Classical cryptosystems proposed by Robert McEliece (1978) and Harold Niederreiter (1986) and their modern variations are studied. A detailed review of five code-based public key cryptosystems has been presented.
V. V. Davydov +4 more
doaj +2 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 +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 +1 more source
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
Decoding algorithms for Goppa codes with errors and erasures [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 In 1978, McEliece built the first public key cryptosystem based on error-correcting codes. This cryptosystem based on Goppa codes is considered promising and cryptographically stable, taking into account quantum computing.
Ratseev, Sergey Mihailovich +1 more
doaj +1 more source
Post-quantum cryptography-driven security framework for cloud computing
Open Computer Science, 2022 Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails.
Ukwuoma Henry Chima +3 more
doaj +1 more source
A New Class of Q-Ary Codes for the McEliece Cryptosystem
Cryptography, 2021 The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers for the McEliece system and a new channel model.
Jürgen Freudenberger +1 more
doaj +1 more source
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 +4 more
openaire +2 more sources