Karatsuba Multiplication
Karatsuba Multiplication is a divide-and-conquer algorithm for fast integer multiplication that reduces the computational complexity of multiplying two n-digit numbers by recursively decomposing them into smaller parts and combining results with fewer multiplicative operations than the classical quadratic-time method.
103
Publications
2.9K
Citations
238
Authors
112
Institutions
Publications per year
2017–2026
43
Parents
103
Overlap-free Karatsuba–Ofman polynomial multiplication algorithms
Haining Fan, Jiaguang Sun, Musong Gu et al. · IET Information Security · 2010 · 79 citations
1–5 of 103
238
7
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 238
112
Tsinghua University
Beijing, China
10 h-index
23 publications
802 citations
Pusan National University
Busan, South Korea
6 h-index
19 publications
410 citations
Institute of Microelectronics
Beijing, China
6 h-index
12 publications
352 citations
Nanyang Technological University
Singapore, Singapore
5 h-index
6 publications
143 citations
Lunghwa University of Science and Technology
Taoyuan City, Taiwan
5 h-index
5 publications
96 citations
Xinyang Normal University
Xinyang, China
3 h-index
9 publications
183 citations
National Institute of Technology Kurukshetra
Kurukshetra, India
3 h-index
6 publications
114 citations
KU Leuven
Leuven, Belgium
2 h-index
8 publications
220 citations
1–8 of 112
12 publications · 543 citations
12
h-index
7 publications · 136 citations
7
h-index
5 publications · 149 citations
5
h-index
4 publications · 114 citations
4
h-index
3 publications · 125 citations
3
h-index
1–5