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

	Submitted exclusively to the London Mathematical Society doi:Reduced Memory Meet-in-the-Middle Attack against the NTRU Private Key Christine van Vredendaal DocID: 1pn68 - View Document
	1. J. Hoffstein, A. Kontorovich, The first non-vanishing quadratic twist of an automorphic L-series, preprint 2. S. Ganguly, J. Hoffstein, J. Sengupta, Determining modular forms on SL(2, Z) by central values of convoluti DocID: 1a7I2 - View Document
	Curriculum Vitae: Jill C. Pipher ACADEMIC DEGREES B.A. in Mathematics, UCLA, 1979 PhD. in Mathematics, UCLA, 1985, Harmonic Analysis DocID: 19Pac - View Document
	Proposal of a new efficient public key system for encryption and digital signatures Gerold Gr¨ unauer Email: DocID: 12GG8 - View Document
	Noncommutative Polly Cracker-type cryptosystems and chosen-ciphertext security Tapan Rai ∗ and Stanislav Bulygin † DocID: 12FTJ - View Document