Integral Sampler and Polynomial Multiplication Architecture for Lattice-based Cryptography
Abstract
With the surge of the powerful quantum computer, lattice-based cryptography proliferated the latest cryptography hardware implementation due to its resistance against quantum computers. Among the computational blocks of lattice-based cryptography, the random errors produced by the sampler play a key role in ensuring the security of these schemes. This paper proposes an integral architecture for the sampler, which can reduce the overall resource consumption by reusing the multipliers and adders within the modular polynomial computation. For instance, our experimental results show that the proposed design can effectively reduce the discrete Ziggurat sampling method in DSP usage.
Cite
@article{arxiv.2208.14270,
title = {Integral Sampler and Polynomial Multiplication Architecture for Lattice-based Cryptography},
author = {Antian Wang and Weihang Tan and Keshab K. Parhi and Yingjie Lao},
journal= {arXiv preprint arXiv:2208.14270},
year = {2022}
}
Comments
6 pages, accepted by 35th IEEE Int. Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems