ON THE CIRCUIT-SIZE OF INVERSES (Q3224957): Difference between revisions

@@ Property / cites work @@
+THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M<sub>k, 1</sub> AND THEIR COMPLEXITY
+Normal rank
@@ Property / cites work @@
+Does the polynomial hierarchy collapse if onto functions are invertible?
+Normal rank
@@ Property / cites work @@
+Inverting onto functions.
@@ Property / cites work: Inverting onto functions. / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Measures for Public-Key Cryptosystems
@@ Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank @@
+Normal rank
@@ Property / cites work @@
+If P \(\neq\) NP then some strongly noninvertible functions are invertible
+Normal rank
@@ Property / cites work @@
+Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
+Normal rank
@@ Property / cites work @@
+Characterizing the existence of one-way permutations
+Normal rank
@@ Property / cites work @@
+Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
+Normal rank
@@ Property / cites work @@
+One-way permutations and self-witnessing languages
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+On Regular Rings
@@ Property / cites work: On Regular Rings / rank @@
+Normal rank
@@ Property / cites work @@
+On characterizing the existence of partial one-way permutations
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank