×
Abstract: Through the use of F-metrics, a McEliece type public-key cryptosystem based around generalised Reed Solomon codes is constructed and implemented.
I. INTRODUCTION. Reed-Solomon codes were introduced in the 1960's based upon constructing polynomials from data symbols and creating.
Through the use of F-metrics, a McEliece type public-key cryptosystem based around generalised Reed Solomon codes is constructed and implemented.
Jan 22, 1995 · The rst public-key cryptosystem based on linear codes was proposed by. McEliece in 1978 [4]. The system is based on the family of Goppa codes.
People also ask
A special class of rank distance codes are the Gabidulin codes for which an efficient decoding algorithm exists [4] . We will define these codes by their ...
He gave the notion of code-based cryptography and developed the public key cryptosystem based on binary Goppa codes in 1978, namely McEliece cryptosystem.
Jul 1, 2019 · A new type of GRS code-based cryptosystem has been presented, which improves over previous solutions by allowing a larger set of instances ...
The main idea of the proposal is to use, instead of a permutation matrix, the sum T +R, where T is a sparse matrix of row weight m and R is a matrix of rank z.
Missing: metrics | Show results with:metrics
We present a code-based public-key cryptosystem, in which we use Reed-Solomon codes over an extension field as secret codes and disguise it by considering its ...
For GRS codes, as well as for Goppa codes, there exist algorithms for correcting errors of hamming norm up to half of the minimum distance in. O(n2) ...