Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates

First Page		Document Content
Date: 2018-10-22 05:36:47 Mathematics Algebra Abstract algebra Multiplication Polynomials ToomCook multiplication NTRUEncrypt Multiplication algorithm Karatsuba algorithm Division algorithm Resultant XTR		Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates Add to Reading List Source URL: cryptojedi.org Download Document from Source Website File Size: 725,43 KB Share Document on Facebook

	Computer Networks–716 www.elsevier.com/locate/comnet Remote timing attacks are practical David Brumley a DocID: 1r5d7 - View Document
	Space- and Time-Efficient Polynomial Multiplication DocID: 1r1wg - View Document
	Code generation for polynomial multiplication ´ Ling Ding1 and Eric Schost2 1 DocID: 1qp1c - View Document
	RelaxMiddle-JSCStyle-sent.pdf DocID: 1oo1n - View Document
	Algorithms and Data Structures Winter TermExercises for Unit 6 s 1. Spell out the general divide-and-conquer algorithm for multiplying polymomials that was DocID: 1onxf - View Document