2022 19th International SoC Design Conference (ISOCC) 2022
DOI: 10.1109/isocc56007.2022.10031366
|View full text |Cite
|
Sign up to set email alerts
|

Hardware Design of Optimized Large Integer Schoolbook Polynomial Multiplications on FPGA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…This holds true not only for the Kyber cryptography algorithm but also for other cryptographic algorithms. Polynomial multiplication can be computed using several algorithms, including the schoolbook algorithm [8][9][10], Karatsuba algorithm [11,12], Toom-Cook algorithm [13,14], and NTT algorithm [15][16][17]. Out of these algorithms, the schoolbook algorithm is the most basic and straightforward.…”
Section: Introductionmentioning
confidence: 99%
“…This holds true not only for the Kyber cryptography algorithm but also for other cryptographic algorithms. Polynomial multiplication can be computed using several algorithms, including the schoolbook algorithm [8][9][10], Karatsuba algorithm [11,12], Toom-Cook algorithm [13,14], and NTT algorithm [15][16][17]. Out of these algorithms, the schoolbook algorithm is the most basic and straightforward.…”
Section: Introductionmentioning
confidence: 99%