Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A McEliece cryptosystem using permutation codes
View through CrossRef
Abstract
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. We show that these cryptosystems are insecure. However, the general framework in these cryptosystems can use any permutation error-correcting code and is interesting. We present an enhanced McEliece cryptosystem, which subsumes the McEliece cryptosystem based on linear error correcting codes.
Title: A McEliece cryptosystem using permutation codes
Description:
Abstract
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.
We show that these cryptosystems are insecure.
However, the general framework in these cryptosystems can use any permutation error-correcting code and is interesting.
We present an enhanced McEliece cryptosystem, which subsumes the McEliece cryptosystem based on linear error correcting codes.
Related Results
Cryptanalysis of McEliece cryptosystem variants based on quasi‐cyclic low‐density parity check codes
Cryptanalysis of McEliece cryptosystem variants based on quasi‐cyclic low‐density parity check codes
One of the approaches to modify the McEliece cryptosystem to overcome its large key size is replacing binary Goppa codes with a new structured code. However, this modification make...
Leveraging LDPC-Optimized Niederreiter Cryptosystems for Quantum-Resilient IoT Security Applications
Leveraging LDPC-Optimized Niederreiter Cryptosystems for Quantum-Resilient IoT Security Applications
The Niederreiter Cryptosystem is a well-established post-quantum cryptographic scheme knownfor its security, yet it suffers from large key sizes and computational inefficiencies, m...
Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem
In this chapter, the authors have defined a new ElGamal cryptosystem by using the power Fibonacci sequence module m. Then they have defined a new sequence module m and the other El...
Implementation of McEliece Algorithm in Code-Based Cryptography
Implementation of McEliece Algorithm in Code-Based Cryptography
The McEliece algorithm is an asymmetric cryptosystem based on error-correcting codes, relying on the complexity of the syndrome decoding problem for its security. This study discus...
Decoding of block and convolutional codes in rank metric
Decoding of block and convolutional codes in rank metric
Décodage des codes en bloc et des codes convolutifs en métrique rang
Les code en métrique rang attirent l’attention depuis quelques années en raison de leur applica...
On Permutation BE-algebra
On Permutation BE-algebra
We present permutation BE-algebras as a new class of BE-algebras and examine their basic features in this work. The goal of this paper is to look into and discuss some new notions ...
Cryptography With Mceliece Algorithm (Code Based Cryptography)
Cryptography With Mceliece Algorithm (Code Based Cryptography)
Cryptography is the science used to protect information from unauthorized access. One promising cryptographic algorithm is the McEliece algorithm, which uses code-based cryptograph...
Reentrant permutation flow shop problems: definitions and heuristics
Reentrant permutation flow shop problems: definitions and heuristics
Abstract
In a flow shop, jobs are serially processed on a set of machines and the machine order is the same for all the jobs. In a permutation flow shop, there is...