Secure PRNGs from Specialized Polynomial Maps over Any Fq Michael Feng-Hao Liu∗

First Page		Document Content
Date: 2007-10-22 14:34:16 Probabilistic complexity theory Polynomials Pseudorandom number generator Randomized algorithm IP Coding theory Sipser–Lautemann theorem Normal distribution Theoretical computer science Mathematics Computational complexity theory		Secure PRNGs from Specialized Polynomial Maps over Any Fq Michael Feng-Hao Liu∗ Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 417,07 KB Share Document on Facebook

	MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXBETTER POLYNOMIALS FOR GNFS SHI BAI, CYRIL BOUVIER, ALEXANDER KRUPPA, AND PAUL ZIMMERMANN DocID: 1xVRE - View Document
	An Introduction to the Dynamics of Real and Complex Quadratic Polynomials. May 30, 2011 Abstract DocID: 1xVv1 - View Document
	On Computing the Resultant of Generic Bivariate Polynomials Gilles Villard Univ Lyon, CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, LIP UMR 5668, FLyon, France ABSTRACT An algorithm is presented for DocID: 1xVkU - View Document
	LibPoly: A Library for Reasoning about Polynomials∗ Dejan Jovanovi´c and Bruno Dutertre SRI International Abstract LibPoly is a C library for computing with polynomials. It provides data structures to represent multiv DocID: 1xUTX - View Document