-
1
-
-
0023545074
-
On Hiding Information from an Oracle
-
Abadi, M., Feigenbaum, J., and Kilian, J., On Hiding Information from an Oracle, Proceedings of the 19th Annual ACM Symposium on Theory of Computing.
-
Proceedings of the 19Th Annual ACM Symposium on Theory of Computing
-
-
Abadi, M.1
Feigenbaum, J.2
Kilian, J.3
-
2
-
-
0023985196
-
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
-
April
-
Alexi, W., Chor, B., Goldreich, O., and Schnorr, C.P., RSA and Rabin Functions: Certain Parts are as Hard as the Whole, SIAM J. Comput., April, 1988.
-
(1988)
SIAM J. Comput
-
-
Alexi, W.1
Chor, B.2
Goldreich, O.3
Schnorr, C.P.4
-
3
-
-
0003415652
-
-
Addison-Wesley
-
Aho, A.V., Hopcroft J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
-
(1974)
The Design and Analysis of Computer Algorithms
-
-
Aho, A.V.1
Hopcroft, J.E.2
Ullman, J.D.3
-
5
-
-
0021522644
-
How to generate Cryptographically Strong Sequences of Pseudo-Random Bits
-
Blum, M. and Micali, S., How to generate Cryptographically Strong Sequences of Pseudo-Random Bits, SIAM J. Comp., 13, 1984.
-
(1984)
SIAM J. Comp
, pp. 13
-
-
Blum, M.1
Micali, S.2
-
6
-
-
0041937636
-
An Efficient Probabilistic Public Key Encryption Scheme which Hides all Partial Information
-
Blum, M. and Goldwasser, S., An Efficient Probabilistic Public Key Encryption Scheme which Hides all Partial Information, Proceedings of Crypto’ 84.
-
Proceedings of Crypto’ 84
-
-
Blum, M.1
Goldwasser, S.2
-
7
-
-
35048835189
-
Untraceable Electronic Cash
-
Chaum, D., Fiat, A., and Naor, M., Untraceable Electronic Cash, Proceedings of Crypto’ 88.
-
Proceedings of Crypto’ 88
-
-
Chaum, D.1
Fiat, A.2
Naor, M.3
-
9
-
-
84874800178
-
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
-
El Gamal, T., A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, Vol IT-31, 1985.
-
(1985)
IEEE Transactions on Information Theory
, vol.IT-31
-
-
El Gamal, T.1
-
10
-
-
33746337429
-
How to Prove Yourself: Practical Solutions to Identification and Signature Problems
-
Fiat, A., and Shamir, A., How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings of Crypto’ 86.
-
Proceedings of Crypto’ 86
-
-
Fiat, A.1
Shamir, A.2
-
11
-
-
0023985465
-
A Secure Digital Signature Scheme
-
April
-
Goldwasser, S., S. Micali, and R.L. Rivest, A Secure Digital Signature Scheme, SIAM J. Comput., April, 1988.
-
(1988)
SIAM J. Comput
-
-
Goldwasser, S.1
Micali, S.2
Rivest, R.L.3
-
12
-
-
0003094772
-
On using RSA with Low Exponent in a Public Key Network
-
Håstad, J., On using RSA with Low Exponent in a Public Key Network, Proceedings of Crypto’ 85.
-
Proceedings of Crypto’ 85
-
-
Håstad, J.1
-
13
-
-
0003294665
-
The Art of Computer Programming
-
2nd ed., Addison-Wesley
-
Knuth, D., The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, 1981.
-
(1981)
Seminumerical Algorithms
, vol.2
-
-
Knuth, D.1
-
15
-
-
0020194569
-
Fast decipherment algorithm for RSA public-key cryptosystem
-
Quisquater, J.-J. and Couvreur, C, Fast decipherment algorithm for RSA public-key cryptosystem, Electronic letters, vol. 18, 1982, pp. 905-907.
-
(1982)
Electronic Letters
, vol.18
, pp. 905-907
-
-
Quisquater, J.-J.1
Couvreur, C.2
-
17
-
-
0017930809
-
A Method for Obtaining Digital Signatures and Public Key Cryptosystems
-
Rivest, R.L., Shamir, A. and Adleman, L., A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Comm. ACM, Vol. 21, No. 2, 1978.
-
(1978)
Comm. ACM
, vol.21
, Issue.2
-
-
Rivest, R.L.1
Shamir, A.2
Adleman, L.3
-
18
-
-
38049015677
-
On the Generation of Cryptographically Strong Pseudorandom Sequences
-
Shamir, A., On the Generation of Cryptographically Strong Pseudorandom Sequences, ACM Trans. on Computer Systems, Vol. 1, No. 1, 1983.
-
(1983)
ACM Trans. on Computer Systems
, vol.1
, Issue.1
-
-
Shamir, A.1
|