Parameter Selection for Server-Aided RSA Computation Schemes

IEEE Transactions on Computers

Volumn 43, Issue 2, 1994, Pages 163-174

  Burns, John ^a   Mitchell, Chris J ^b  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Digital signature modular exponentiation RSA; server aided computation smart card

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CRYPTOGRAPHY; NETWORK PROTOCOLS; NUMBER THEORY; PARAMETER ESTIMATION; PROGRAM PROCESSORS; SECURITY OF DATA;

DIGITAL SIGNATURE; MODULAR EXPONENTIATION; PARAMETER SELECTION; SERVER AIDED RSA COMPUTATION SCHEMES;

SMART CARDS;

EID: 0028381806     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.262121     Document Type: Article

References (8)

1. D. Gollmann, private communication, Jan. 1991.
2. J. Hastad, “On using RSA with low exponent in a public key network,” in Advances in Cryptology—CRYPTO ‘85 Proc., Santa Barbara, CA, 1986, pp. 403-408.
3. D. E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 2nd ed. Reading, MA: Addison-Wesley, 1981.
4. T. Matsumoto, K. Kato, and H. Imai, “Speeding up secret computations with insecure auxiliary devices,” in Advances in Cryptology: CRYPTO ‘88, Proc., Santa Barbara, CA, 1990, pp. 497-506.
5. J-J. Quisquater and C. Couvreur, “Fast decipherment algorithm for RSA public-key cryptosystem,” Electronics Letters, vol. 18, pp. 905-907, 1982.
6. J-J. Quisquater and M. De Soete, “Speeding up smart card RSA computations with insecure coprocessors,” in Smart Card 2000, D. Chaum, Ed. Amsterdam: North-Holland, 1991, pp. 191-197.
7. A. Shimbo and S. Kawamura, “Factorization attack on certain server-aided aided computation protocols for the RSA secret transformation,” Electronics Letters, vol. 26, pp. 1387-1388, 1990.
8. M. J. Wiener, “Cryptanalysis of short RSA secret exponents,” IEEE Trans. Information Theory, vol. IT-36, pp. 553-558, 1990.