Probabilistic encryption & how to play mental poker keeping secret all partial information
暂无分享,去创建一个
[1] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.
[2] D. Bernstein. DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .
[3] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[4] Gilles Brassard,et al. Relativized cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[5] M. Rabin. DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .
[6] Gary L. Miller,et al. On taking roots in finite fields , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[7] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[8] N. S. Barnett,et al. Private communication , 1969 .
[9] D. Shanks. Solved and Unsolved Problems in Number Theory , 1964 .