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

First Page		Document Content
Date: 2016-05-19 17:03:48 Mathematics 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 List Source URL: www.lix.polytechnique.fr Download Document from Source Website File Size: 331,66 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