First Page | Document Content | |
---|---|---|
Date: 2011-05-18 16:43:49Mathematics Mathematical analysis Algebra Fourier analysis Polynomials Unitary operators Multiplication Discrete Fourier transform Numerical analysis Polynomial Fourier transform Root of unity | Polynomials and the Fast Fourier Transform (FFT)Add to Reading ListSource URL: web.cecs.pdx.eduDownload Document from Source WebsiteFile Size: 554,42 KBShare Document on Facebook |
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 |