query: Cryptographically secure PRNG from a hash function
positive_passages.docid: 22599
positive_passages.text: Using a Hash as a secure PRNG
negative_passages.docid: 84835
negative_passages.text: Can a computationally unbounded adversary break any public-key encryption scheme?
negative_passages.docid: 62196
negative_passages.text: Statistical saturation attack on block ciphers
negative_passages.docid: 12035
negative_passages.text: XOR cipher with fixed key and known relation among plaintexts
negative_passages.docid: 122054
negative_passages.text: SHA-3 Sub-Function Reversibility Clarification
negative_passages.docid: 20174
negative_passages.text: Discrete mathematics bit strings
negative_passages.docid: 87659
negative_passages.text: SHA256 HMAC brute force with chosen plaintext attacks
negative_passages.docid: 2567
negative_passages.text: Secure hash and salt for PHP passwords
negative_passages.docid: 87852
negative_passages.text: RSA key pair generation using PRNG with same seed
negative_passages.docid: 80154
negative_passages.text: Selection of cryptographic functions for OAEP
negative_passages.docid: 41777
negative_passages.text: Hash functions to generate a one-time pad
negative_passages.docid: 41240
negative_passages.text: Generating a cryptographically secure, many-time use, symmetric encryption key
negative_passages.docid: 98404
negative_passages.text: Is there a simple hash function that one can compute without a computer?
negative_passages.docid: 35218
negative_passages.text: Are there any practical implementation of a homomorphic hashing or signature scheme?
negative_passages.docid: 33888
negative_passages.text: Are there MD5 collisions for inputs of different length?
negative_passages.docid: 147696
negative_passages.text: Security equivalence proofs for breaking RSA
negative_passages.docid: 17900
negative_passages.text: Early propagation of carries in the BLAKE hash function