• 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}
}
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
1
Twitter Mention

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Arithmetic and factorization of polynomials over F_2

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Attacking and defending the McEliece cryptosystem

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Shift-register synthesis and BCH decoding

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Power Decoding Reed-Solomon Codes Up to the Johnson Radius

VIEW 1 EXCERPT

Quantum resistant random linear code based public key encryption scheme RLCE

  • Yongge Wang
  • Computer Science
  • 2016 IEEE International Symposium on Information Theory (ISIT)
  • 2015
VIEW 1 EXCERPT

Additive Fast Fourier Transforms Over Finite Fields

VIEW 3 EXCERPTS