Encryption scheme based on expanded Reed-Solomon codes
Karan Khathuria, Joachim Rosenthal, Violetta Weger · Advances in Mathematics of Communications · 2020
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 \begin{document}$ 45 \% $\end{document} compared to the classic {McE}liece cryptosystem proposed by Bernstein et al.