A Family of Scalable Polynomial Multiplier Architectures for Ring-LWE Based Cryptosystems

@article{Du2016AFO,
  title={A Family of Scalable Polynomial Multiplier Architectures for Ring-LWE Based Cryptosystems},
  author={Chaohui Du and Guoqiang Bai},
  journal={IACR Cryptology ePrint Archive},
  year={2016},
  volume={2016},
  pages={323}
}
Many lattice based cryptosystems are based on the Ring learning with errors (Ring-LWE) problem. The most critical and computationally intensive operation of these Ring-LWE based cryptosystems is polynomial multiplication over rings. In this paper, we exploit the number theoretic transform (NTT) to build a family of scalable polynomial multiplier architectures, which provide designers with a trade-off choice of speed vs. area. Our polynomial multipliers are capable to calculate the product of… CONTINUE READING
2 Citations
28 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Spartan-6 fpga block ram resources user guide

  • Xilinx
  • 2011, http: //www.xilinx.com/support…
  • 2011
Highly Influential
2 Excerpts

NSA seeks to build quantum computer that could crack most types of encryption

  • S. Rich, B. Gellman
  • The Washington Post, Jan 2014, http://www…
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…