Modified GPT PKC with right scrambler
EM Gabidulin, AV Ourivski - Electronic Notes in Discrete Mathematics, 2001 - Elsevier
In 1991 Gabidulin, Paramonov and Tretjakov presented a public key cryptosystem of the
McEliece type based on rank codes correcting array errors, GPT system. The main
advantage of rank codes is that it is impossible to use combinatoric decoding for these
codes. This enabled using public keys of smaller sizes. Subsequently in a series of works
Gibson developed attacks that break the GPT system for public keys of about 5 Kbits. In this
paper, we present a new PKC based on the idea of a right scrambler—a special non …
McEliece type based on rank codes correcting array errors, GPT system. The main
advantage of rank codes is that it is impossible to use combinatoric decoding for these
codes. This enabled using public keys of smaller sizes. Subsequently in a series of works
Gibson developed attacks that break the GPT system for public keys of about 5 Kbits. In this
paper, we present a new PKC based on the idea of a right scrambler—a special non …
Showing the best result for this search. See all results