A. Karatsuba and Y. Ofman. Multiplication of Many-Digital Numbers by Automatic Computers. In Doklady Akad. Nauk SSSR 145, 293--294, 1962. Translation in Physics-Doklady 7, 595--596, 1963. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An End-to-End Systems Approach to Elliptic Curve.. - Gura, Shantz, Eberle, .. (2002) (2 citations) (Correct)
....are executed for m = 163. To compensate for the missing shift operation in the latter case, a multiplexer was added to select the bits of Z # to be reduced. The reduction is hard wired and takes another clock cycle. The alternative designs we studied were based on the Karatsuba algorithm [14] and the LSD multiplier [22] Applying the Karatsuba algorithm to Figure 6, we first split the 64 bit by 256 bit multiplication X[63. 0]#Y [255. 0] into four 64bit by 64 bit multiplications X[63. 0] Y [255. 192] and then use the Karatsuba algorithm to calculate the four partial products. ....
Karatsuba, A., Ofman, Y.: Multiplication of Many-Digital Numbers by Automatic Computers. Doklady Akad. Nauk, SSSR 145, 293-294. Translation in Physics-Doklady 7, 595-596, 1963.
Hardware and Software Normal Basis Arithmetic for Pairing.. - Granger, Page, Stam (2004) (1 citation) (Correct)
No context found.
A. Karatsuba and Y. Ofman. Multiplication of Many-Digital Numbers by Automatic Computers. In Doklady Akad. Nauk SSSR 145, 293--294, 1962. Translation in Physics-Doklady 7, 595--596, 1963.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC