Modular Arithmetic Algorithms
Modular Arithmetic Algorithms is a class of computational methods that perform arithmetic operations within the finite set of integers modulo a given integer, distinguished by their reliance on congruence relations to enable efficient computation in number-theoretic and cryptographic applications.
357
Publications
17.8K
Citations
641
Authors
354
Institutions
Publications per year
2017–2026
56
357
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
1–5 of 357
641
12
h-index
10
h-index
9
h-index
8
h-index
Centre National de la Recherche Scientifique, France
7 publications · 398 citations
7
h-index
1–5 of 641
354

Centre National de la Recherche Scientifique
Paris, France
13 h-index
20 publications
748 citations
Oregon State University
Corvallis, United States
12 h-index
23 publications
2.3K citations
Tsinghua University
Beijing, China
10 h-index
28 publications
1.4K citations
Institute of Microelectronics
Beijing, China
10 h-index
30 publications
1.4K citations

University of Manchester
Manchester, United Kingdom
8 h-index
10 publications
1K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
10 publications
369 citations
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Montpellier, France
6 h-index
9 publications
305 citations
Simon Fraser University
Burnaby, Canada
6 h-index
9 publications
200 citations
1–8 of 354
28 publications · 1.8K citations
21
h-index
MCOM · 13 publications · 3.8K citations
12
h-index
10 publications · 794 citations
10
h-index
11 publications · 606 citations
10
h-index
8 publications · 147 citations
8
h-index
1–5