Title :
Lagrange interpolation polynomials and generalized Reed-Solomon codes over rings of matrices
Author_Institution :
Inst. of Inf. Eng., Beijing, China
Abstract :
In this paper we first give the Lagrange interpolation polynomials in rings of matrices over finite fields and propose a new secret sharing scheme similar to Shamir´s secret sharing scheme as its direct application in cryptography. We also introduce the generalized Reed-Solomon codes over a noncommutative ring of matrices over a finite field and study their properties using this interpolation formula. We show that they are maximum distance separable (MDS) and present the key equation by deriving their dual codes and Goppa formulation.
Keywords :
Reed-Solomon codes; cryptography; dual codes; interpolation; polynomials; Goppa formulation; Lagrange interpolation polynomials; MDS; Shamir´s secret sharing scheme; cryptography; dual codes; finite fields; generalized Reed-Solomon codes; maximum distance separable; noncommutative ring; rings of matrices; Cryptography; Interpolation; Linear code; Polynomials; Reed-Solomon codes; Zirconium; Lagrange interpolation formula; codes over rings; polynomial rings over matrix rings; quasi-cyclic codes; secret sharing schemes;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6284132