Breaking RSA may be as difficult as factoring (Q271594): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00145-014-9192-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2037848441
@@ Property / OpenAlex ID: W2037848441 / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking RSA Generically Is Equivalent to Factoring
+Normal rank
@@ Property / cites work @@
+Q4229172
@@ Property / cites work: Q4229172 / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking RSA may not be equivalent to factoring
@@ Property / cites work: Breaking RSA may not be equivalent to factoring / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
+Normal rank
@@ Property / cites work @@
+Q4737249
@@ Property / cites work: Q4737249 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
+Normal rank
@@ Property / cites work @@
+Q4718481
@@ Property / cites work: Q4718481 / rank @@
+Normal rank
@@ Property / cites work @@
+Riemann's hypothesis and tests for primality
@@ Property / cites work: Riemann's hypothesis and tests for primality / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249665
@@ Property / cites work: Q4249665 / rank @@
+Normal rank
@@ Property / cites work @@
+A method for obtaining digital signatures and public-key cryptosystems
+Normal rank