Back to Results
First PageMeta Content
Binary arithmetic / Cryptographically secure pseudorandom number generator / Parity bit / RSA / Boolean algebra / FO / XTR / Blum Blum Shub / Blum–Goldwasser cryptosystem / Cryptography / Pseudorandom number generators / Electronic commerce


--- Efficient and Secure Pseudo-Random Number Generation. (Extended Abstract) Umesh V. Vazirani *
Add to Reading List

Document Date: 2005-06-09 20:48:30

Open Document

File Size: 567,27 KB

Share Result on Facebook

City

Las Vegas / /

Company

IBM / Oracle / /

Currency

pence / USD / /

Facility

Vqay V. Vaxirani University of California / Harvard University / /

IndustryTerm

decryption algorithm / successive partial solutions / /

Organization

University of California / Berkeley / Harvard University / National Science Foundation / United Nations / MIT / Computer Science Department / /

Person

Manuel Blum / A. Shamir / Lenore Blum / Michael Rabin / M. Ben-Or / B. Chor / Les Valiant / /

ProvinceOrState

California / /

Technology

Las Vegas algorithm / decryption algorithm / /

SocialTag