 Date: 2016-05-19 17:03:48Mathematics Multiplication Polynomials Algebra Multiplication algorithm Computer algebra ToomCook multiplication Karatsuba algorithm Degree of a polynomial Finite field Remainder Computational complexity of mathematical operations | |  Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW
Add to Reading ListSource URL: www.lix.polytechnique.frDownload Document from Source Website File Size: 331,66 KBShare Document on Facebook
|
![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 candidates](https://www.pdfsearch.io/img/2b67922afe05e21e532fc723f460d172.jpg "Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates")
