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

	On the mathematical structure and hidden symmetries of the Born-Infeld field equations Diego Julio Cirilo-Lombardo JINR University, Russian federation DocID: 1q3Tb - View Document
	Introduction The MQ Problem Polynomial Equivalence Problems DocID: 1nx18 - View Document
	MQ Challenge: Hardness Evaluation of Solving MQ problems DocID: 18rai - View Document
	Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡ DocID: 18odj - View Document
	PDF Document DocID: 17s8a - View Document