×
Jun 2, 2010 · In this paper, we introduce a new approach, called the Smart approach, which is based on a proper choice of the distortion matrix X. The Smart ...
In 1991 Gabidulin, Paramonov and Tretjakov proposed a newversion of the McEliece cryptosystem (GPT) based on maximum rank distance codes insteadof hamming ...
Jun 2, 2010 · Firstly, it is more robust against decoding attacks than McEliece's Cryptosystem; secondly, the key size of the GPT is much smaller and more ...
The concept of Public- key cryptosystem was innovated by McEliece's cryptosystem. The public key cryptosystem based on rank codes was presented in 1991 by ...
The use of rank codes in cryptographic applications is advantageous since it is practically impossible to utilize combinatoric decoding. This has enabled using ...
Aug 13, 2018 · Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary: A Smart Approach for GPT Cryptosystem Based on Rank Codes. CoRR abs/1006.0386 (2010).
In this paper we describe the rank metric based McEliece type cryptosystems which where first introduced by Gabidulin, Paramonov and Tretjakov in the 90's.
Oct 28, 2020 · This paper describes a new algorithm for breaking the smart approach of the GPT cryptosystem. We show that by puncturing the public code several times on ...
Oct 20, 2013 · [19] H. Rashwan, E. M. Gabidulin, B. Honary, "A Smart approach for GPT cryptosystem based on rank codes", Proc. of. 2010 IEEE International ...
A new algorithm for breaking the smart approach of the GPT cryptosystem is described, showing that by puncturing the public code several times on specific ...