A method for obtaining digital signatures and public-key cryptosystems
暂无分享,去创建一个
[1] I. Niven,et al. An introduction to the theory of numbers , 1961 .
[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[3] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .
[4] J. M. Pollard,et al. Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.
[5] Gary L. Miller. Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..
[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] Whitfield Diffie,et al. Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard , 1977, Computer.
[9] Jack Levine,et al. Some Cryptographic Applications of Permutation Polynomials , 1977, Cryptologia.
[10] Ralph C. Merkle,et al. Secure communications over insecure channels , 1978, CACM.
[11] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.