We propose design methodologies for building a compact, unified and programmable
cryptoprocessor architecture that computes post-quantum key agreement and digital …

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

Recently, the construction of cryptographic schemes based on hard lattice problems has
gained immense popularity. Apart from being quantum resistant, lattice-based cryptography …

Polynomial multiplication over rings is a significant bottleneck of ring learning with error
(RLWE)-based encryption. To speed it up, three algorithms are widely used, ie, number …

Polynomial multiplication over rings is a significant bottleneck of ring learning with error
(RLWE)-based encryption. To speed it up, the number theoretic transform (NTT) and Toom …

Progress of quantum computing technology seriously threaten the industrial information
security based on traditional public-key cryptosystem. Thus, the cryptosystem with anti …

Post-quantum cryptography (PQC) uses novel difficult mathematical principles to defend the
cracking of quantum computers which threaten the traditional crypto system such as Rivest …

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 …

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 …

Conventional cryptographic systems protect the data security during communication but give
third-party cloud operators complete access to compute decrypted user data. Homomorphic …