Parallel Random Numbers: As Easy as 1, 2, 3 ∗ ∗† John K. Salmon, Mark A. Moraes, Ron O. Dror, and David E. Shaw

First Page		Document Content
Date: 2011-10-02 11:06:07 Randomness Key management Fortuna ISAAC Linear congruential generator Cryptographic hash function Random number generation Mersenne twister Advanced Encryption Standard Cryptography Pseudorandom number generators Stream ciphers		Parallel Random Numbers: As Easy as 1, 2, 3 ∗ ∗† John K. Salmon, Mark A. Moraes, Ron O. Dror, and David E. Shaw Add to Reading List Source URL: www.thesalmons.org Download Document from Source Website File Size: 273,48 KB Share Document on Facebook

	-Invertible Cycles for Multivariate Quadratic (MQ) Public Key Cryptography Jintai Ding1, , Christopher Wolf2 , and Bo-Yin Yang3, 1 University of Cincinnati and Technische Universität Darmstadt DocID: 1xVV9 - View Document
	Public-Key Cryptography from New Multivariate Quadratic Assumptions Yun-Ju Huang1,3 , Feng-Hao Liu2 , and Bo-Yin Yang3 1 3 DocID: 1xVNp - View Document
	ECE/CS498: Applied Cryptography Instructor: Andrew Miller, TA: Kevin Liao Lecture 2: Interactive Proofs 1 DocID: 1xVMd - View Document
	The Art of Cryptography Zero Knowledge Proofs Abhiram Kothapalli Two Balls and the Color-Blind Friend DocID: 1xVLd - View Document
	Multivariate Cryptography Louis Goubin, Versailles St-Quentin-en-Yvelines University, France, Jacques Patarin, Versailles St-Quentin-en-Yvelines University, France, and Bo-Yin Yang, Institute of Information Science, Acad DocID: 1xVDQ - View Document