Modular Multiplication is a binary operation in modular arithmetic that computes the product of two integers modulo a given integer, yielding the remainder when their ordinary product is divided by the modulus.
308
Publications
15.5K
Citations
603
Authors
273
Institutions
Publications per year
2017–2026
70
Parents
Publications
308
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Modular Multiplication Without Trial Division
Peter L. Montgomery · Mathematics of Computation · 1985 · 1.1K citations · Full text
Montgomery exponentiation needs no final subtractions
Colin D. Walter · Electronics Letters · 1999 · 250 citations
1–5 of 308
Authors
603
- ÇK
12
h-index
- SL
10
h-index
- CD
8
h-index
- BP
7
h-index
- ZL
7
h-index
1–5 of 603
Institutions
273
Institute of Microelectronics
Beijing, China
12 h-index
33 publications
807 citations
Tsinghua University
Beijing, China
11 h-index
26 publications
722 citations
Queen's University Belfast
Belfast, United Kingdom
10 h-index
23 publications
1.1K citations
KU Leuven
Leuven, Belgium
10 h-index
29 publications
1.3K citations
Nanjing University of Aeronautics and Astronautics
Nanjing, China
9 h-index
20 publications
500 citations
Centre National de la Recherche Scientifique
Paris, France
8 h-index
10 publications
548 citations
Oregon State University
Corvallis, United States
8 h-index
13 publications
1.7K citations
University of Manchester
Manchester, United Kingdom
7 h-index
9 publications
1K citations
1–8 of 273
Venues
- IEEE Transactions on Computers
36 publications · 2.3K citations
26
h-index
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
12 publications · 615 citations
11
h-index
- Electronics Letters
10 publications · 790 citations
10
h-index
- IEEE Transactions on Circuits and Systems I Regular Papers
8 publications · 328 citations
8
h-index
- International Journal of Computer Mathematics
5 publications · 104 citations
5
h-index
1–5