Name
Abstract | ||
|---|---|---|
Lattice-based cryptography (LBC) is one of the promising post-quantum candidates which offers good security and performance. The most time consuming operations in LBC is the polynomial multiplication, which can be performed through widely explored algorithms like schoolbook polynomial multiplication algorithm (SPMA) and Number Theoretic Transform (NTT). However, Karatsuba algorithm with better com... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TCSII.2020.3049002 | IEEE Transactions on Circuits and Systems II: Express Briefs |
Keywords | DocType | Volume |
Hardware,Cryptography,Throughput,Circuits and systems,Memory management,Convolution,Field programmable gate arrays | Journal | 68 |
Issue | ISSN | Citations |
6 | 1549-7747 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zheng-Yan Wong | 1 | 0 | 0.34 |
| Denis C. K. Wong | 2 | 0 | 1.69 |
| Wai-Kong Lee | 3 | 37 | 13.00 |
| Kai Ming Mok | 4 | 1 | 1.37 |