[1]
R. Rivest,A. Shamir, L. Aldeman, A Methoed for Obtaining DigitalSignatures and Public-key Cryptosystems,J. Communications of the ACM, 1978, 21(2): 120-126.
DOI: 10.1145/359340.359342
Google Scholar
[2]
A . Fiat, Batch RSA, "C. Proc of Crypto , 89, LNCS435, 1989. Berlin: Springer -Verlag, 1989: 175-185.
Google Scholar
[3]
D. Boneh, H. Shacham, Fast Variants of RSA,R. RSA Laboratories Cryptophytes, 2002, 5(1): 1-8.
Google Scholar
[4]
T. Takagi. Fast RSA-type cryptosystem modulo pkq. In H. Krawczyk, editor, CRYPTO, volume 1462 of Lecture Notes in Computer Science, pages 318–326. Springer, (1998).
DOI: 10.1007/bfb0055738
Google Scholar
[5]
T. Matsumoto, K. Kato, Speeding up secret computations with insecure auxiliary device,C. Proc of the 8th Annual International Crypto Conference on Advances in Cryptology. London: Springer-Verlag, (1988).
DOI: 10.1007/0-387-34799-2_35
Google Scholar
[6]
C. Castelluccia, E. Mykletun, and G. Tsudik. Improving secure server performance by re-balancing SSL/TLS handshakes,C. Proc of the 2006 ACM Symposium on Information, computer and communications security. New York: ACM, 2006: pages 26-34.
DOI: 10.1145/1128817.1128826
Google Scholar
[7]
J-J. Quisquater and C. Couvreur, Fast decipherment algorithm for RSA public-key cryptosystem,J. Eletronic Letters, vol 18: 905–907, (1982).
DOI: 10.1049/el:19820617
Google Scholar