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

	1 Cellular growth and division in the Gillespie algorithm Ting Lu1 , Dmitri Volfson2,3 , Lev Tsimring2 and Jeff Hasty3 1 DocID: 1vcMv - View Document
	Firehose: An Algorithm for Distributed Page Registration on Clusters of SMPs Christian Bell Rajesh Nishtala May 2004: CS262B Final Project Computer Science Division DocID: 1tJkd - View Document
	1 Solving Triangular Systems More Accurately and Efficiently Ph. Langlois, N. Louvet DALI-LP2A Laboratory. Universit´e de Perpignan. 52, avenue Paul Alduy. FPerpignan cedex. DocID: 1rgin - View Document
	published in SIAM Journal on Scientific Computing (SISC), 26(6):, ACCURATE SUM AND DOT PRODUCT∗ TAKESHI OGITA †, DocID: 1raFt - View Document
	SOUTHWICK C E PRIMARY SCHOOL CALCULATION POLICY Multiplication Reception Year DocID: 1qMRJ - View Document