Secure PRNGs from Specialized Polynomial Maps over Any Fq Feng-Hao Liu1 , Chi-Jen Lu2 , and Bo-Yin Yang2 1 Department of Computer Science, Brown University, Providence RI, USA

First Page		Document Content
Date: 2012-03-10 01:26:44 Cryptography Mathematics Polynomials Multivariate cryptography Algebra Pseudorandom number generator Computer algebra Hidden Field Equations QUAD Field extension Cryptographically secure pseudorandom number generator Mersenne Twister		Secure PRNGs from Specialized Polynomial Maps over Any Fq Feng-Hao Liu1 , Chi-Jen Lu2 , and Bo-Yin Yang2 1 Department of Computer Science, Brown University, Providence RI, USA Add to Reading List Source URL: precision.moscito.org Download Document from Source Website File Size: 416,59 KB Share Document on Facebook

	3 May 1998 ITERATED RANDOM FUNCTIONS Persi Diaconis Department of Mathematics & ORIE Cornell University DocID: 1xVWv - View Document
	SCAN 2018 Post-conference Proceedings Special Issue of Journal of Computational and Applied Mathematics Call for Papers Special Issue on the 18th International Symposium on Scientific Computing, Computer Arithmetic, DocID: 1xVSx - View Document
	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
	A characterization of Riemann integrability Cosmin Burtea Faculty of Mathematics, "Al. I. Cuza" University of Ia³i, Romania Abstract We prove a characterization of Riemann integrability by using some Darboux-like sums w DocID: 1xVOd - View Document
	Mathematics 7-12, BS "DBEFNJD.BQ 5IF"DBEFNJD.BQTFSWFTBTBTVHHFTUFEDPVSTFTFRVFODFPOMZ4UVEFOUTBSFOPUMJNJUFEUPUIJTQMBOJUJTNFBOUUPCFVTFEBT DocID: 1xVH0 - View Document