First Page | Document Content | |
---|---|---|
Date: 2018-09-09 03:28:07Mathematics Algebra Abstract algebra Post-quantum cryptography Multiplication Lattice-based cryptography Cryptography Karatsuba algorithm NTRU Lattice Polynomial ring Field extension | Fast Ideal Lattice-Based KEMs on ARM Cortex-M4 Matthias J. Kannwischer, Joost Rijneveld, Peter Schwabe September 03, 2018Add to Reading ListSource URL: kannwischer.euDownload Document from Source WebsiteFile Size: 229,44 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 |