• Computer Science, Mathematics
• Published in
  IACR Cryptology ePrint…
  2017

Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes

@article{Wang2017DecodingGR,
  title={Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes},
  author={Yongge Wang},
  journal={IACR Cryptology ePrint Archive},
  year={2017},
  volume={2017},
  pages={733}
}

• Yongge Wang

This paper compares the efficiency of various algorithms for implementing quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 \cite{moenck1976practical}) that Karatsuba's algorithm outperforms classical polynomial multiplication algorithm from the degree 15 and above (practically… CONTINUE READING

View PDF on ArXiv

Save to Library

Create Alert

Cite