Integral Sampler and Polynomial Multiplication Architecture for Lattice-based Cryptography. (arXiv:2208.14270v1 [cs.CR])

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 …

architecture cryptography