|
2507
|
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
– R.L. Rivest, A. Shamir, L. Adleman
- 1978
|
|
2057
|
Handbook of Applied Cryptography
– Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest
- 1997
|
|
36
|
A p+1 method of factoring
– H C Williams
- 1982
|
|
25
|
Chameleon Hashing and Signatures
– Hugo Krawczyk , Tal Rabin
- 1998
|
|
30
|
New Generation of Secure and Practical RSA-based Signatures
– Ronald Cramer, Ivan Damgård
- 1996
|
|
18
|
Algorithmic Number Theory, volume 1
– BS96 Eric Bach, Jeffrey Shallit
- 1996
|
|
148
|
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
– Niko Baric, Birgit Pfitzmann
- 1997
|
|
175
|
A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory
– L C Guillou, J-J Quisquater
- 1988
|
|
711
|
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
– Shafi Goldwasser, Silvio Micali, Ronald L. Rivest
- 1995
|
|
106
|
Secure hash-and-sign signatures without the random oracle
– Rosario Gennaro, Shai Halevi, Tal Rabin
- 1999
|
|
199
|
Factoring integers with elliptic curves
– H W Lenstra
- 1987
|
|
2292
|
New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
- 1976
|
|
28
|
Average Case Error Estimates for the Strong Probable Prime Test
– I Damgard, P Landrock, C Pomerance, C
- 1993
|
|
14
|
Strong primes are easy to find
– J Gordon
- 1984
|
|
1130
|
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
– Mihir Bellare, Phillip Rogaway
- 1995
|
|
61
|
Theorems of factorization and primality testing
– John M Pollard
- 1974
|
|
69
|
The multiple polynomial quadratic sieve
– R D Silverman
- 1987
|
|
559
|
Elliptic curve cryptosystems
– N Koblitz
- 1987
|
|
419
|
Use of elliptic curves in cryptography
– V Miller
- 1986
|
