All Bits in ax + b mod p are Hard (Q3452346): Difference between revisions

@@ Property / cites work @@
+RSA and Rabin Functions: Certain Parts are as Hard as the Whole
+Normal rank
@@ Property / cites work @@
+A Simple Unpredictable Pseudo-Random Number Generator
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Probabilistic encryption
@@ Property / cites work: Probabilistic encryption / rank @@
+Normal rank
@@ Property / cites work @@
+The discrete logarithm modulo a composite hides \(O(n)\) bits
+Normal rank
@@ Property / cites work @@
+Q4767350
@@ Property / cites work: Q4767350 / rank @@
+Normal rank
@@ Property / cites work @@
+The Discrete Logarithm Hides $O(\log n)$ Bits
@@ Property / cites work: The Discrete Logarithm Hides $O(\log n)$ Bits / rank @@
+Normal rank
@@ Property / cites work @@
+Q4279590
@@ Property / cites work: Q4279590 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2757258
@@ Property / cites work: Q2757258 / rank @@
+Normal rank