Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
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
Tessa Lau
AI Magazine
Conference paper
Risks and potentials of using EMV for internet payments
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019