<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2007-09-27 11:26:00Pseudorandomness Pseudorandom number generators Computational complexity theory Algorithmic information theory Pseudorandom generator Blum Blum Shub RC4 Naor-Reingold Pseudorandom Function Theoretical computer science Cryptography Applied mathematics |
| Modèle de Blum, Shub et Smale Théorème de transfert pour la question P = NP dansDocID: 1nqo9 - View Document |
| . The Dual Elliptic Curve Deterministic RBG . Background, Specification, Security and NotesDocID: 16F7Z - View Document |
| --- Efficient and Secure Pseudo-Random Number Generation. (Extended Abstract) Umesh V. Vazirani *DocID: zPw4 - View Document |
| A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model.DocID: 8JiD - View Document |
| Motivation (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of ComputationDocID: 5ARc - View Document |