  Security of currently deployed public key cryptography algorithms is foreseen
to be vulnerable against quantum computer attacks. Hence, a community effort
exists to develop post-quantum cryptography (PQC) algorithms, i.e., algorithms
that are resistant to quantum attacks. In this work, we have investigated how
lattice-based candidate algorithms from the NIST PQC standardization
competition fare when conceived as hardware accelerators. To achieve this, we
have assessed the reference implementations of selected algorithms with the
goal of identifying what are their basic building blocks. We assume the
hardware accelerators will be implemented in application specific integrated
circuit (ASIC) and the targeted technology in our experiments is a commercial
65nm node. In order to estimate the characteristics of each algorithm, we have
assessed their memory requirements, use of multipliers, and how each algorithm
employs hashing functions. Furthermore, for these building blocks, we have
collected area and power figures for 12 candidate algorithms. For memories, we
make use of a commercial memory compiler. For logic, we make use of a standard
cell library. In order to compare the candidate algorithms fairly, we select a
reference frequency of operation of 500MHz. Our results reveal that our area
and power numbers are comparable to the state of the art, despite targeting a
higher frequency of operation and a higher security level in our experiments.
The comprehensive investigation of lattice-based NIST PQC algorithms performed
in this paper can be used for guiding ASIC designers when selecting an
appropriate algorithm while respecting requirements and design constraints.
