论文信息 - The RSA cryptosystem - 字舞流文

The RSA cryptosystem

Norman Biggs | N. Biggs

[1] C. Pomerance,et al. Prime Numbers: A Computational Perspective , 2002 .

[2] Arjen K. Lenstra,et al. The Magic Words are Squeamish Ossifrage , 1994, ASIACRYPT.

[3] Gary L. Miller. Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[4] M. Rabin. Probabilistic algorithm for testing primality , 1980 .

[5] Paul C. Kocher,et al. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems , 1996, CRYPTO.

[6] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[7] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[8] Manindra Agrawal,et al. PRIMES is in P , 2004 .