Documents Related by Co-Citation

233 Factoring integers with elliptic curves – H W Lenstra - 1987
2895 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
192 A probabilistic algorithm for testing primality – Michael Rabin - 1980
2693 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
107 On distinguishing prime numbers from composite numbers – L M Adleman, C Pomerance, R S Rumely - 1983
45 Primality Testing and Abelian Varieties over Finite Fields, LNM 1512 – L M Adleman, M-D Huang - 1992
1109 A public key cryptosystem and a signature scheme based on discrete logarithms – T ElGamal - 1985
171 Elliptic curves over finite fields and the computation of square roots mod p – René Schoof - 1985
137 A fast Monte-Carlo test for primality – R Solovay, V Strassen - 1977
691 Elliptic curve cryptosystems – N Koblitz - 1987
207 Riemann’s hypothesis and tests for primality – Gary L Miller - 1976
285 Elliptic Curve Public Key Cryptosystems – A J Menezes - 1993
528 Uses of elliptic curves in cryptography – V Miller - 1985
54 Recognizing primes in random polynomial time – L M Adleman, M-D Huang - 1987
1172 Probabilistic encryption – S Goldwasser, S Micali - 1984
42 Non-interactive public-key cryptography – U M Maurer, Y Yacobi - 1991
72 Theorems of factorization and primality testing – J Pollard - 1974
819 The Arithmetic of Elliptic Curves – J Silverman
102 Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv – D V Chudnovsky, G V Chudnovsky - 2000