<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-11-01 20:46:02Mathematics Arithmetic Computational complexity theory Multiplication Algebra Finite fields Karatsuba algorithm XTR Polynomials Recurrence relation Time complexity Algorithm |
Add to Reading List |
Code generation for polynomial multiplication ´ Ling Ding1 and Eric Schost2 1![Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates](https://www.pdfsearch.io/img/bd31747deb2db7da5a44f16d2e87b8ea.jpg "Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates") | 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 candidates](https://www.pdfsearch.io/img/2b67922afe05e21e532fc723f460d172.jpg "Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates") | 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 |