A new cryptosystem using generalized Mersenne primes (Q258874): Difference between revisions

@@ Property / cites work @@
+Breaking RSA may be as difficult as factoring
@@ Property / cites work: Breaking RSA may be as difficult as factoring / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient probabilistic public-key cryptosystem over quadratic fields quotients
+Normal rank
@@ Property / cites work @@
+New directions in cryptography
@@ Property / cites work: New directions in cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+A public key cryptosystem and a signature scheme based on discrete logarithms
+Normal rank
@@ Property / cites work @@
+The discrete logarithm modulo a composite hides \(O(n)\) bits
+Normal rank
@@ Property / cites work @@
+On generalized Mersenne prime
@@ Property / cites work: On generalized Mersenne prime / rank @@
+Normal rank
@@ Property / cites work @@
+On generalized mersenne primes and class-numbers of equivalent quadratic fields and cyclotomic fields
+Normal rank
@@ Property / cites work @@
+Q4718481
@@ Property / cites work: Q4718481 / rank @@
+Normal rank
@@ Property / cites work @@
+A key distribution system equivalent to factoring
@@ Property / cites work: A key distribution system equivalent to factoring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4950039
@@ Property / cites work: Q4950039 / rank @@
+Normal rank
@@ Property / cites work @@
+A method for obtaining digital signatures and public-key cryptosystems
+Normal rank
@@ Property / cites work @@
+Q4839149
@@ Property / cites work: Q4839149 / rank @@
+Normal rank