Name
Abstract | ||
|---|---|---|
Quantum computers promise to solve hard mathematical problems such as integer factorization and discrete logarithms in polynomial time, making standardized public-key cryptosystems insecure. Lattice-Based Cryptography (LBC) is a promising post-quantum public key cryptographic protocol that could replace standardized public key cryptography, thanks to the inherent post-quantum resistant properties, efficiency, and versatility. A key mathematical tool in LBC is the Number Theoretic Transform (NTT), a common method to compute polynomial multiplication. It is the most compute-intensive routine and requires acceleration for practical deployment of LBC protocols. In this paper, we propose CryptoPIM, a high-throughput Processing In-Memory (PIM) accelerator for NTT-based polynomial multiplier with the support of polynomials with degrees up to 32k. Compared to the fastest FPGA implementation of an NTT-based multiplier, CryptoPIM achieves on average 31x throughput improvement with the same energy and only 28% performance reduction, thereby showing promise for practical deployment of LBC. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/DAC18072.2020.9218730 | PROCEEDINGS OF THE 2020 57TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC) |
Keywords | DocType | ISSN |
Lattice-based Cryptography, Acceleration, Number Theoretic Transform, Homomorphic Encryption, Processing in Memory | Conference | 0738-100X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamid Nejatollahi | 1 | 22 | 5.02 |
| Saransh Gupta | 2 | 101 | 11.58 |
| Mohsen Imani | 3 | 341 | 48.13 |
| Tajana Simunic | 4 | 3198 | 266.23 |
| Rosario Cammarota | 5 | 111 | 12.05 |
| Nikil Dutt | 6 | 4960 | 421.49 |