×
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.
Given any integer q power of a prime and any integer n there is a family of MRD-codes of length n over \FF{q^n} having polynomial-time decoding algorithms.
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 ...
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 we look at the Gabidulin version of the McEliece cryptosys- tem (GPT) and its variants. We give an overview over the existing ...
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