I read a cryptography paper on "How to Play Mental Poker" by Goldwasser and Micali. I can't remember all of it and so I'll only put what I remember on here. I may have remembered some of it wrong but bear with me. It's basically a combination of ideas. It uses RSA and another guy whose name starts with R's elaborations on their idea. The paper then discusses how RSA can work with the coin flipping technique of probabilistic encryption to play Mental Poker. RSA works with some stuff squared times mod it being it answer. It has to do with primality and how it's really hard to figure out if a number is prime without already having its factor. There's the primality test though that many systems use as the basis for finding prime numbers. So then the two players in the mental poker game each encrypt a stack of 52 "cards." Then, the other player draws from the opposing player's deck, then removing the same card from his/her own deck so there are no duplicates. They are given a key by the owner but the owner still doesn't know which card the opponent chose because that key reveals nothing to the owner, since the owner has insufficient information. They play until they find out if its secure or someone wins.
Some downfalls of this method is unintended adversaries may still intercept messages and understand them without knowing full well what the message contains. So it cannot be used for messages which need this kind of encryption but it works for all the others.
Some downfalls of this method is unintended adversaries may still intercept messages and understand them without knowing full well what the message contains. So it cannot be used for messages which need this kind of encryption but it works for all the others.
