Lattice-based cryptography relies on the hardness of lattice problems. Lattice-based cryptosystems are quantum resistant and are often provably secure based on worst-case hardness assumptions. The interest in lattice-based cryptography is increasing due to its quantum resistance and its provable security under some worst-case hardness assumptions. As this is a relatively new topic, the search for efficient hardware architectures for lattice-based cryptographic building blocks is still an active area of research. The authors present area optimizations for the most critical and computationally-intensive operation in lattice-based cryptography: polynomial multiplication with the Number Theoretic Transform (NTT).