Modular Inverse Computation is a mathematical procedure within number theory that determines, for a given integer \( a \) and modulus \( m \), the unique integer \( a^{-1} \) such that \( a \cdot a^{-1} \equiv 1 \pmod{m} \), provided that \( a \) and \( m \) are coprime.
29
Publications
1.6K
Citations
62
Authors
33
Institutions
Publications per year
2017–2026
10
Parents
Publications
29
The Montgomery inverse and its applications
Burton S. Kaliski · IEEE Transactions on Computers · 1995 · 172 citations
The Montgomery modular inverse-revisited
Erkay Savaş, Çetin Kaya Koç · IEEE Transactions on Computers · 2000 · 118 citations
1–5 of 29
Authors
62
- WZ
2
h-index
- ÇK
2
h-index
- JD
2
h-index
- IE
2
h-index
- SX
2
h-index
1–5 of 62
Institutions
33
Institute of Microelectronics
Beijing, China
2 h-index
5 publications
205 citations
Oregon State University
Corvallis, United States
2 h-index
5 publications
317 citations
Jinan University
Guangzhou, China
2 h-index
4 publications
348 citations
Macquarie University
Sydney, Australia
2 h-index
3 publications
58 citations
Tsinghua University
Beijing, China
2 h-index
5 publications
205 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
1 h-index
1 publications
40 citations
New Jersey Institute of Technology
Newark, United States
1 h-index
1 publications
12 citations
University of Bristol
Bristol, United Kingdom
1 h-index
1 publications
54 citations
1–8 of 33
Venues
- IEEE Transactions on Computers
2 publications · 290 citations
2
h-index
- IoT
1 publications · 12 citations
1
h-index
- HAL (Le Centre pour la Communication Scientifique Directe)
Repository · 1 publications · 11 citations
1
h-index
- Linear Algebra and its Applications
1 publications · 10 citations
1
h-index
- EURASIP Journal on Embedded Systems
1 publications · 10 citations
1
h-index
1–5