Pages that link to "Item:Q3339289"
From MaRDI portal
The following pages link to How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289):
Displaying 6 items.
- Hardness vs randomness (Q1337458) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- Practical Chosen Ciphertext Secure Encryption from Factoring (Q3627442) (← links)
