Encryption Scheme Based on Expanded Reed-Solomon Codes
Cryptography and Security
2020-05-12 v4 Information Theory
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 compared to the classic McEliece cryptosystem proposed by Bernstein et al.
Keywords
Cite
@article{arxiv.1906.00745,
title = {Encryption Scheme Based on Expanded Reed-Solomon Codes},
author = {Karan Khathuria and Joachim Rosenthal and Violetta Weger},
journal= {arXiv preprint arXiv:1906.00745},
year = {2020}
}