2000 character limit reached
Encryption Scheme Based on Expanded Reed-Solomon Codes (1906.00745v4)
Published 3 Jun 2019 in cs.CR, cs.IT, and math.IT
Abstract: 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 shortened expanded code over the base field. Considering shortened expanded codes provides a safeguard against distinguisher attacks based on the Schur product. Moreover, without using a cyclic or a quasi-cyclic structure we obtain a key size reduction of nearly $45 \%$ compared to the classic McEliece cryptosystem proposed by Bernstein et al.