×
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.
People also ask
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.
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 ...
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 ...
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) ...
Abstract. In this paper a new structural attack on the McEliece/Nieder- reiter public key cryptosystem based on subcodes of generalized Reed-. Solomon codes ...
Missing: metrics | Show results with:metrics
Abstract. In this paper we look at the Gabidulin version of the McEliece cryptosys- tem (GPT) and its variants. We give an overview over the existing ...
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 ...