Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters (1994)

Cached

Download Links

by Ueli M. Maurer
Venue:Journal of Cryptology
Citations:21 - 0 self

Documents Related by Co-Citation

2890 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
2445 Handbook of Applied Cryptography – Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest - 1997
40 A p +1 method of factoring – H C Williams - 1982
19 Algorithmic Number Theory - Volume 1 – E Bach, J Shallit - 1996
27 Chameleon Hashing and Signatures – Hugo Krawczyk , Tal Rabin - 1998
36 New Generation of Secure and Practical RSA-based Signatures – Ronald Cramer, Ivan Damgård - 1996
198 A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory – L C Guillou, J-J Quisquater - 1988
164 Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees – Niko Baric, Birgit Pfitzmann - 1997
829 A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks – Shafi Goldwasser, Silvio Micali, Ronald L. Rivest - 1995
121 Secure hash-and-sign signatures without the random oracle – Rosario Gennaro, Shai Halevi, Tal Rabin - 1999
233 Factoring Integers with Elliptic Curves – Hendrik W Lenstra - 1987
2689 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
33 Average case error estimates for the strong probable prime test – P Landrock, C Pomerance
16 Strong primes are easy to find – J Gordon - 1985
8 Fast Generation Of Random, Strong RSA Primes – Robert D. Silverman - 1997
1329 Random Oracles are Practical: A Paradigm for Designing Efficient Protocols – Mihir Bellare, Phillip Rogaway - 1995
71 Theorems of factorization and primality testing – J Pollard - 1974
75 The multiple polynomial quadratic sieve – R Silverman - 1987
689 Elliptic curve cryptosystems – N Koblitz - 1987