Telephonic Poker?

Article View: sci.crypt

Article #2655

#2655

From: Jonathan Haas
Date: Sun, 03 Jan 1993 18:56

16 lines
1228 bytes

I was reading a paper that explained the RSA algorithm
in layman's terms, and among other things it said, "An
interesting side benefit of this algorithm is that it
makes it possible for two people who do not trust each
other to play poker by telephone." I've thought about
it, and I can't for the life of me figure out HOW. The
paper did not elaborate. Can someone explain to me the
algorithm with which two mutually distrusting players can
play poker by phone (or, more simply, have a fair coin
toss)?

-- 
__/\__  Jonathan S. Haas         | Jake liked his women the way he liked
\    /  University of Michigan   | his kiwi fruit: sweet yet tart, firm-
/_  _\  positron@eecs.umich.edu  | fleshed yet yielding to the touch, and
  \/                             | covered with short brown fuzzy hair.

Technical Details

Message-ID: <1993Jan3.185628.2976@zip.eecs.umich.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!doc.ic.ac.uk!agate!spool.mu.edu!umn.edu!umeecs!quip.eecs.umich.edu!positron

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!doc.ic.ac.uk!agate!spool.mu.edu!umn.edu!umeecs!quip.eecs.umich.edu!positron
From: positron@quip.eecs.umich.edu (Jonathan Haas)
Newsgroups: sci.crypt
Subject: Telephonic Poker?
Message-ID: <1993Jan3.185628.2976@zip.eecs.umich.edu>
Date: 3 Jan 93 18:56:28 GMT
Sender: news@zip.eecs.umich.edu (Mr. News)
Organization: University of Michigan EECS Dept., Ann Arbor
Lines: 16