If P \(\neq\) NP then some strongly noninvertible functions are invertible (Q2508963): Difference between revisions

@@ Property / cites work @@
+Q3747725
@@ Property / cites work: Q3747725 / rank @@
+Normal rank
@@ Property / cites work @@
+P-Printable Sets
@@ Property / cites work: P-Printable Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321931
@@ Property / cites work: Q4321931 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4293543
@@ Property / cites work: Q4293543 / 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 @@
+Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
+Normal rank
@@ Property / cites work @@
+Theoretical Computer Science
@@ Property / cites work: Theoretical Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
+Normal rank
@@ Property / cites work @@
+Is the data encryption standard a group? (Results of cycling experiments on DES)
+Normal rank
@@ Property / cites work @@
+On some natural complete operators
@@ Property / cites work: On some natural complete operators / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+An observation on associative one-way functions in complexity theory
+Normal rank
@@ Property / cites work @@
+A survey of one-way functions in complexity theory
+Normal rank