Abstract
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.
Chapter PDF
Keywords
- Discrete Logarithm
- Discrete Logarithm Problem
- Quadratic Residue
- Yorktown Height
- Linear Diophantine Equation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L.M. Adleman, “A subexponential algorithm for the discrete logarithm problem with applications to cryptography,” Proc. 20th IEEE Found. Comp. Sci. Symp. (1979), 55–60.
D. Coppersmith, A.M. Odlyzko and R. Schroeppel, “Discrete Logarithms in GF(p),” Research Report RC 10985, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 10598, February 14, 1985.
R.A. DeMillo, G.I. Davida, D.P. Dobkin, M.A. Harrison and R.J. Lipton, Applied Cryptology, Cryptographic Protocols, and Computer Security Models, vol. 29, Proceedings of Symposia in Applied Mathematics, American Mathematical Society, 1983. Chapter 4.11, “Compromising Protocols.”
S. Goldwasser and S. Micali, “Probabilistic Encryption & How To Play Mental Poker Keeping Secret All Partial Information,” Proc. 14th ACM Symposium on Theory of Computing (1982), 365–377.
J.C. Lagarias, “Knapsack Public Key Cryptosystems and Diophantine Approximation (Extended Abstract),” Advances in Cryptology, Proceedings of Crypto 83, (Ed.: D. Chaum), Plenum Press, New York, 1983, 289–301.
A.K. Lenstra, H.W. Lenstra, Jr. and L. Lovasz, “Factoring Polynomials with Rational Coefficients,” Math. Annalen. 261 (1982), 515–534.
S.C. Pohlig and M. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE Trans. Inform. Theory IT-24 (1978), 106–110.
A. Shamir, R.L. Rivest and L.M. Adleman, “Mental Poker,” MIT/LCS/TM-125, Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, February 1979.
A.E. Western and J.C.P. Miller, Tables of Indices and Primitive Roots, Royal Society Mathematical Tables, vol. 9, Cambridge Univ. Press, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coppersmith, D. (1986). Cheating at Mental Poker. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive