论文信息 - Cheating at Mental Poker

Cheating at Mental Poker

We review the “mental poker” scheme described by Shamir, Rivest and Adleman [SRA]. We present two possible means of cheating, depending on careless implementation of the SRA scheme. One will work if the prime p is such that p-1 has a small prime divisor. In the other scheme, the names of the cards “TWO OF CLUBS” have been extended by random-looking bits. chosen by the cheater.

Don Coppersmith | D. Coppersmith

[1] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[2] Leonard M. Adleman,et al. A subexponential algorithm for the discrete logarithm problem with applications to cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3] Silvio Micali,et al. Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.

[4] Michael A. Harrison,et al. Applied Cryptology, Cryptographic Protocols, and Computer Security Models , 1983 .

[5] A. E. Western,et al. Tables of indices and primitive roots , 1968 .

[6] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[7] David Chaum,et al. Advances in Cryptology: Proceedings Of Crypto 83 , 2012 .