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

	Computational Methods 14-04, 14Qxx [1] Fatima K. Abu Salem and Kamal Khuri-Makdisi, Fast Jacobian group operations for C3,4 curves over a large finite field, LMS J. Comput. Math), 307–328 (electronic). MR MR2 DocID: 1v3WQ - View Document
	FINITE FIELDS KEITH CONRAD This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and Fp interchangeably for t DocID: 1uTzP - View Document
	MATH 205 (TOPICS IN ALGEBRAIC NUMBER THEORY) - SPRINGProfessor: Cristian D. Popescu Course Topic: Global Fields Course Description: The main goal of this course is to understand global fields (finite field extensi DocID: 1uKaO - View Document
	FINITE GROUP SCHEMES OVER BASES WITH LOW RAMIFICATION BRIAN CONRAD Abstract. Let A0 be a complete characteristic (0, p) discrete valuation ring with absolute ramification degree e and a perfect residue field. We are inte DocID: 1uGnL - View Document
	Pseudorandom generators for low degree polynomials Andrej Bogdanov∗ March 3, 2005 Abstract We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite field DocID: 1uF0R - View Document