Vinayak Gupta, Rajmohan C, et al.
ICON 2022
The time required to perform multiplication is investigated. A lower bound on the time required to perform multiplication, as well as multiplication modulo N, is derived and it is shown that these lower bounds can be approached. Then a lower bound on the amount of time required to perform the most significant part of multiplication (xy/N) is derived. © 1967, ACM. All rights reserved.
Vinayak Gupta, Rajmohan C, et al.
ICON 2022
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
P.C. Yue, C.K. Wong
Journal of the ACM
Kazuaki Ishizaki, Takeshi Ogasawara, et al.
VEE 2012