Cryptoprotocols: Subscription to a public key, the secret blocking and the multi-player mental poker game
暂无分享,去创建一个
[1] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[3] Manuel Blum,et al. How to exchange (secret) keys , 1983, TOCS.
[4] E. Berlekamp. Factoring polynomials over large finite fields* , 1970, SYMSAC '71.
[5] Adi Shamir,et al. How to share a secret , 1979, CACM.
[6] M. Rabin. DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .
[7] I. Niven,et al. An introduction to the theory of numbers , 1961 .
[8] Manuel Blum,et al. An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information , 1985, CRYPTO.
[9] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[10] Silvio Micali,et al. Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.
[11] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[12] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..