1998
DOI: 10.1080/00207169808804708
|View full text |Cite
|
Sign up to set email alerts
|

Parallel modular multiplication with table look-up

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

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…Two technologies for finding the modulo modulo remainder have received the widest practical use: Barrett's algorithm [9] and Montgomery algorithm [13]. The first one is funded in calculating the minimum value of m for which A⋅B -m⋅X < X.…”
Section: Information Computing and Intelligent Systems №mentioning
confidence: 99%
“…Two technologies for finding the modulo modulo remainder have received the widest practical use: Barrett's algorithm [9] and Montgomery algorithm [13]. The first one is funded in calculating the minimum value of m for which A⋅B -m⋅X < X.…”
Section: Information Computing and Intelligent Systems №mentioning
confidence: 99%