scholar.google.com › citations
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
In which public key cryptosystem keys are used for encryption and decryption?
What are the principal ingredients of a public key cryptosystem?
What is a public key cryptosystem in information security?
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.
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 ...
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 ...
Nov 30, 2019 · We proposed a new code-based public-key cryptosystem based on the deriva- tion of Gabidulin codes. We did not consider security reductions ...