2021 3rd International Conference on Signal Processing and Communication (ICPSC) 2021
DOI: 10.1109/icspc51351.2021.9451717
|View full text |Cite
|
Sign up to set email alerts
|

A High Speed Montgomery Multiplier used in Security Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…However, many implementations for a low area cost have problems with their long carry chains, which will highly impact the performance of MMM. Although several high-performance adders such as the Kogge-Stone adder [14], carry-skip adder [15], carry-select adder [16], and Reverse Carry Propagate adder [17] are trying to solve this problem, they either have a higher demand for area or cannot meet all radix requirements. Some optimization [18,19] are made in achieving one-cycle latency pipeline word-based MMM by rearranging the basic pipeline algorithm in [20], but they do not change the basic algorithm's iteration and pay much effort on scheduling.…”
Section: Introductionmentioning
confidence: 99%
“…However, many implementations for a low area cost have problems with their long carry chains, which will highly impact the performance of MMM. Although several high-performance adders such as the Kogge-Stone adder [14], carry-skip adder [15], carry-select adder [16], and Reverse Carry Propagate adder [17] are trying to solve this problem, they either have a higher demand for area or cannot meet all radix requirements. Some optimization [18,19] are made in achieving one-cycle latency pipeline word-based MMM by rearranging the basic pipeline algorithm in [20], but they do not change the basic algorithm's iteration and pay much effort on scheduling.…”
Section: Introductionmentioning
confidence: 99%