<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2011-12-03 09:51:22Modular arithmetic Computer arithmetic Finite fields Binary operations Multiplication Residue number system Elliptic curve point multiplication Multiplication algorithm General-purpose computing on graphics processing units Montgomery modular multiplication XTR Division algorithm |
Add to Reading List |
doicomjnl/bxr119 | 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 |