Modular Inversion Algorithms is a class of computational methods within number-theoretic algorithms that compute the multiplicative inverse of an integer modulo a given number, specifically by solving the congruence equation \( ax \equiv 1 \pmod{m} \) for \( x \) when \( a \) and \( m \) are coprime.
54
Publications
2.6K
Citations
121
Authors
75
Institutions
Publications per year
2017–2026
11
Parents
Publications
54
The Montgomery inverse and its applications
Burton S. Kaliski · IEEE Transactions on Computers · 1995 · 172 citations
Modular algorithms for computing Gröbner bases
Elizabeth Arnold · Journal of Symbolic Computation · 2003 · 123 citations
1–5 of 54
Authors
121
- JM
2
h-index
- HZ
2
h-index
- IE
2
h-index
- ÇK
2
h-index
- JY
2
h-index
1–5 of 121
Institutions
75
Macquarie University
Sydney, Australia
3 h-index
5 publications
106 citations
Institute of Information Science
Maribor, Slovenia
2 h-index
2 publications
107 citations
Northwest University
Xi'an, China
2 h-index
2 publications
54 citations
Lund University
Lund, Sweden
2 h-index
5 publications
161 citations
Queen's University Belfast
Belfast, United Kingdom
2 h-index
6 publications
444 citations
Oregon State University
Corvallis, United States
2 h-index
5 publications
317 citations
University of Illinois Chicago
Chicago, United States
2 h-index
2 publications
107 citations
ETH Zurich
Zurich, Switzerland
2 h-index
4 publications
440 citations
1–8 of 75
Venues
- IEEE Transactions on Computers
6 publications · 644 citations
6
h-index
- Electronics Letters
3 publications · 45 citations
3
h-index
- IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
3 publications · 41 citations
3
h-index
- Journal of Symbolic Computation
2 publications · 141 citations
2
h-index
- Information and Computation
1 publications · 636 citations
1
h-index
1–5