Results 1 to 10 of about 2,437 (198)

Modern variations of McEliece and Niederreiter cryptosystems [PDF]

Научно-технический вестник информационных технологий, механики и оптики, 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, V. V. Beliaev, E. F. Kustov, A. G. Leevik, S. V. Bezzateev   +4 more
doaj   +3 more sources

Enhanced Public Key Security for the McEliece Cryptosystem [PDF]

Journal of Cryptology, 2014
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the public key is no longer permutation-equivalent to the secret code. This increases the security level of the public key, thus opening the way for reconsidering the adoption of classical families of codes, like Reed-Solomon codes, that have been longly ...
Marco Baldi, Marco Bianchi, Franco Chiaraluce, Joachim Rosenthal, Davide Schipani   +4 more
exaly   +8 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

Secure and Compact: A New Variant of McEliece Cryptosystem [PDF]

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

A Distinguisher for High-Rate McEliece Cryptosystems [PDF]

IEEE Transactions on Information Theory, 2013
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
Jean‐Charles Faugère, Valérie Gauthier–Umaña, Ayoub Otmani, Ludovic Perret, Jean–Pierre Tillich   +4 more
openalex   +4 more sources

Variations of the McEliece Cryptosystem [PDF]

, 2017
Two variations of the McEliece cryptosystem are presented. The first one is based on a relaxation of the column permutation in the classical McEliece scrambling process.
Alain Couvreur, Anne Canteaut, Ayoub Otmani, Behzad Amiri, Frank R. Kschischang, H. Niederreiter, Heeralal Janwa, John Little, Judea Pearl, Lily Chen, Marco Baldi, R. J. McEliece, R. Overbeck, Shrinivas Kudekar, V. M. Sidelnikov, V. M. Sidelnikov, Violetta Weger   +16 more
core   +3 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.
Daniel J. Bernstein, Tanja Lange, Christiane Peters   +2 more
openalex   +4 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

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. Code based cryptography is an interesting alternative to number theoretic cryptography.
Daniela Engelbert, Raphael Overbeck, Arthur R. Schmidt   +2 more
openalex   +6 more sources

Unfolding Post-Quantum Cryptosystems: CRYSTALS-Dilithium, McEliece, BIKE, and HQC [PDF]

Mathematics
The advent of quantum computers poses a significant threat to the security of classical cryptographic systems. To address this concern, researchers have been actively investigating the development of post-quantum cryptography, which aims to provide ...
Vaghawan Prasad Ojha, Sumit Chauhan, Shantia Yarahmadian, David Carvalho   +3 more
doaj   +2 more sources