Abstract
The concept of Public key cryptosystems based on error correcting codes was invented by McEliece in 1978. In 1991 Gabidulin, Paramonov and Tretjakov proposed a new mversion of the McEliece cryptosystem (GPT) based on maximum rank distance codes instead of hamming distance codes. Respective structural attacks against dierent variants of the GPT cryptosystem were proposed by Gibson and lately by Overbeck. The Overbeck attack breaks all variants of the GPT cryptosystem and are turned out to be either polynomial or exponential depending on parameters of the cryptosystem. Furthermore, In 2013, Gaborit et al. have presented a decoding attack against the parameters of the simple variant of the GPT cryptosystem which were demonstrated to combat the GPT cryptosystem against Overbeck's attack. In this paper, we introduce two new secure approaches against both the structural (Over-beck's attack) and decoding (brute force) attacks. The rst one is called Distortion Matrix Approach (DMA), and the second is called Advanced Approach for Reducible Rank Codes (ARC). The DMA based on proper choice of a distortion matrix X, while, the ARC based on a proper choice of a scramble matrix P. Furthermore, we evaluate the simple variant of GPT cryptosystem against Gaborit et al. attack and demonstrate a new set of parameters which are secure against all known attacks. Our results show the proposed approaches com- bat the structural and decoding attacks with a large reduction in the key size in comparison to the original McEliece cryptosystem.
Highlights
McEliece [1] introduced the first code-based public-key cryptosystem (PKC)
We evaluate the simple variant of GPT cryptosystem against Gaborit et al attack and demonstrate a new set of parameters which are secure against all known attacks
The GPT cryptosystem based on reducible rank codes is described as follows: Plaintext: A Plaintext is any k total
Summary
McEliece [1] introduced the first code-based public-key cryptosystem (PKC). The system is connected to the hardness of the general decoding problem. A new variant, which is called reducible rank codes, was implemented to combat the GPT cryptosystem against structural attacks [14, 15]. In 2013, Gaborit et al have presented two new generic approaches (decoding attacks) to attack Rank Syndrome Decoding (RSD) problem, both approaches have their own interest depending of the type of parameters considered [38] They break the proposed parameters in [24], and [21] which were demonstrated to combat the GPT cryptosystem against Overbeck‘s attack. The proposed approaches combat the structural and decoding attacks with a large reduction in the key size in comparison to the original McEliece cryptosystem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.