Yale Song, Zhen Wen, et al.
IJCAI 2013
Paper
On the Time Required to Perform Multiplication
Abstract
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.
Related
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings
Susumu Horiguchi, Takeo Nakada
Journal of Parallel and Distributed Computing
Conference paper
Risks and potentials of using EMV for internet payments
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999