<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2015-01-21 19:48:43Computational number theory Modular arithmetic Multiplication Euclidean algorithm Greatest common divisor Multiplicative inverse Coprime Modulo operation Extended Euclidean algorithm Mathematics Integer factorization algorithms Number theory |
Add to Reading List |
CS 70 Fall 2003 Discrete Mathematics for CS Wagner | 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 |