We propose a hardware-optimized design that implements a Montgomery Elliptic-curve
point multiplication Algorithm over using Lopez-Dahab projective coordinates. Moreover, we …

Polynomial multiplications based on the number theoretic transform (NTT) are critical in
lattice-based post-quantum cryptography algorithms. Therefore, this paper presents a …

In this brief, we realize different architectural techniques for improving the performance of
post-quantum cryptography (PQC) algorithms when implemented as hardware accelerators …

Lattice-based cryptography is a novel approach to public key cryptography (PKC), of which
the mathematical investigation (so far) resists attacks from quantum computers. By choosing …

Significant research efforts have been dedicated to designing cryptographic algorithms that
are quantum-resistant. The motivation is clear: robust quantum computers, once available …

This paper proposes a novel hardware design for a compact crypto processor devoted to
elliptic-curve point multiplication over GF (2 233). We focus on minimizing hardware usage …

This paper demonstrates an efficient and flexible hardware accelerator for polynomial
multiplication using number theoretic transform (NTT). The proposed architecture considers …

Lattice-based post-quantum cryptography (PQC) algorithms demand number theoretic
transform (NTT)-based polynomial multiplications. NTT-based polynomials' multiplication …

Quantum computers are a significant threat to the existing cryptography algorithms. The
Saber is a lattice-based post-quantum cryptographic or quantum-safe algorithm designed as …

In this brief, we realize different architectural techniques towards improving the performance
of post-quantum cryptography (PQC) algorithms when implemented as hardware …