Modular Arithmetic In Cryptography
Modular Arithmetic in Cryptography is a cryptographic methodology that employs modular arithmetic as its foundational mathematical framework to enable secure encryption, decryption, and key exchange by leveraging the computational hardness of modular inverse and discrete logarithm problems.
175
Publications
5.9K
Citations
391
Authors
184
Institutions
Publications per year
2017–2026
39
Parents
175
Elliptic-Curve-Based Security Processor for RFID
Yong Ki Lee, Kazuo Sakiyama, Lejla Batina et al. · IEEE Transactions on Computers · 2008 · 230 citations · Full text
Systolic modular multiplication
Colin D. Walter · IEEE Transactions on Computers · 1993 · 215 citations
The Montgomery inverse and its applications
Burton S. Kaliski · IEEE Transactions on Computers · 1995 · 172 citations
Exploring the Feasibility of Fully Homomorphic Encryption
Wei Wang, Yin Hu, Lianmu Chen et al. · IEEE Transactions on Computers · 2013 · 131 citations
1–5 of 175
391
8
h-index
6
h-index
4
h-index
4
h-index
4
h-index
1–5 of 391
184
KU Leuven
Leuven, Belgium
7 h-index
19 publications
1.2K citations
Oregon State University
Corvallis, United States
6 h-index
13 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
11 publications
228 citations

University of Manchester
Manchester, United Kingdom
5 h-index
6 publications
332 citations

Pondicherry University
Puducherry, India
4 h-index
8 publications
384 citations
National Tsing Hua University
Hsinchu, Taiwan
4 h-index
11 publications
331 citations

Macquarie University
Sydney, Australia
4 h-index
9 publications
428 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
4 h-index
7 publications
176 citations
1–8 of 184
13 publications · 1K citations
12
h-index
6 publications · 310 citations
6
h-index
4 publications · 75 citations
4
h-index
4 publications · 114 citations
4
h-index
3 publications · 70 citations
3
h-index
1–5