Batch RSA

Journal of Cryptology

Volumn 10, Issue 2, 1997, Pages 75-88

  Fiat, Amos ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Amortization; Assymetric cryptography; Computational complexity; RSA

Indexed keywords

EID: 0013458877     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900021     Document Type: Article

References (26)

1. Abadi, M., Feigenbaum, J., and Kilian, J., On hiding information from an oracle, Proceedings of the \9t Annual ACM Symposium on Theory of Computing, pp. 195-203. New York City, May 25-27, 1987.
2. Aho, A. V., Hopcroft J. E., and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, MA, 1974.
3. Blum, M., Personal communication.
4. Blum, M., Floyd, R. W., Pratt, V., Lewis, R. L., and Tarjan, R. E., Time bounds for selection, J. Comput System Sci. vol. 7 pp. 448-461, 1973.
5. Yacobi, Y., and Beller, M. J., Batch Diffie-Hellman key agreement systems. Proceedings ofEurociyp '92, pp. 208-217.
6. Coppersmith, D., Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory vol. IT-30, no. 4, pp. 587-592, July 1984
7. Coppersmith, D., Modifications to the number field sieve, IBM Research Report #RC 16264.
8. Chaum, D., Fiat, A., and Naor, M., Untraceable electronic cash, Proceedings ofCrypto '88, pp. 319-227 1976.
9. Diffie, W. and Hellman, M. E., New Directions in Cryptography, IEEE Trans. Inform. Theory, vol. IT-22 1976.
10. Dwork, C. and Naor, M., An efficient existentially unforgeable signature scheme and its applications Advances in Cryptology-Proceedings of Crypto '94, Lecture Notes in Computer Science, Vol. 839 Springer-Verlag, Berlin, 1994, pp. 234-346.
11. El Gamal, T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEE Trans. Inform. Theory, vol. IT-31, no. 4, pp. 459-472, July 1985
12. Fiat, A. and Shamir, A., How to prove yourself: Practical solutions to identification and signature problems, Advances in Cryptography-Proceedings of Crypto '86, pp. 186-194, Spinger-Verlag, Berlin 1987.
13. Goldwasser, S., Micali, S., and Rivest, R. L., A digital signature scheme secure against adaptive chose message attacks, SIAM J. Comput., vol. 17, no. 2, pp. 281-308, April 1988.
14. Guillou, L. C. and Quisquater, J. J., A practical zero-knowledge protocol fitted to security microprocesso minimizing both transmission and memory, In: Advances in Cryptology: Proceedings ofEurocrpyt '88 (C.G. Günther, ed.), Davos, Switzerland, May 25-27, pp. 123-128, 1988.
15. Hâstad, J., On using RSA with low exponent in a public key network, Proceedings ofCrypto '85 pp. 403-4(08
16. Koblitz, N., Elliptic curve cryptoSystems, Math. Comput., vol. 48, pp. 203-209, 1987.
17. Knuth, D., Tlie Art of Computer Programming, vol. 2: Seminumerical Algorithms, 2nd edn., Addison Wesley, Reading, MA, 1981.
18. Lenstra, A. K., Lenstra, Jr., H. W., Manasse, M. S., and Pollard, J. M., The number field sieve, Proceeding of the 22nd ACM Symposium on the Theory of Computing, pp. 464-572, 1990.
19. Menezes, A. and Vanstone, S., The implementation of elliptic curve cryptosystems, In: Advances i Cryptology-Auscrypt '90 (J. Seberry, and J. Pieprzyk, eds.), Sydney, Jan. 1990, pp. 2-13.
20. Menezes, A., Okamoto, T., and Vanstone, S., Reducing elliptic curve logarithms to logarithms in a finit field, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pp. 80-89, 1991.
21. Quisquater, J. J. and Couvreur, C., Fast decipherment algorithm for RSA public-key cryptosystem Electronic Letters, vol. 18, no. 21. 1982, pp. 905-907.
22. Rabin, M. O., Digitalized signatures. In: Foundations of Secure Computation, Academic Press, Ne York, 1978.
23. Rivest, R. L., Shamir, A., and Adleman, L., A method for obtaining digital signatures and public ke cryptosystems, Comm. ACM, vol. 21, no. 2, 1978.
24. Shamir, A., On the generation of cryptographically strong pseudorandom sequences,/lCA/ Trans. Comput Systems, vol. l,no. 1, 1983.
25. Tarjan, R. E., Amortized computational complexity, SIAM J. Algebraic Discrete Methods, vol. 2, no. 6 pp. 306-318, 1985.
26. Wiener, M. J., Cryptoanalysis of Short RSA exponents, IEEE Trans. Inform. Theory, vol. 36, no. 3, Ma 1990, pp. 553-558.