<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-04-26 00:17:51Multiplication Computational complexity theory Finite fields Multiplication algorithm Fast Fourier transform Factorial Time complexity XTR SchnhageStrassen algorithm Karatsuba algorithm |
Add to Reading List |
RelaxMiddle-JSCStyle-sent.pdf | Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidatesDocID: 1xVVg - View Document |
| Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidatesDocID: 1xVgU - View Document |
| COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin ThalerDocID: 1xUI5 - View Document |
| Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´DocID: 1vrNt - View Document |
| Contemporary Mathematics The geometry of efficient arithmetic on elliptic curves David Kohel Abstract. The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms oDocID: 1vqo7 - View Document |