Pseudoprimes, Poker and Remote Coin Tossing
Part of the Springer Series in Information Sciences book series (SSINF, volume 7)
KeywordsElliptic Curf Great Common Divisor Fermat Number Sporadic Simple Group Poker Player
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.
Unable to display preview. Download preview PDF.
- 19.5S. Goldwasser, S. Micali: “Probabilistic Encryption and How To Play Mental Poker,” in Proceedings of the 4th ACM Symposium on the Theory of Computing (Assoc. Comp. Machinery, New York 1982) pp. 365–377Google Scholar
- 19.6S. Micali (personal communication)Google Scholar
- 19.7A. Shamir, R. L. Rivest, L. M. Adleman: “Mental Poker,” in The Mathematical Gardener, ed. by D. Klarner (Prindle Weber Schmidt, Boston 1981) pp. 37–43Google Scholar
- 19.14L. M. Adleman, C. Pomerance, R. S. Rumely: On distinguishing prime numbers from composite numbers. Ann. Math. (2) 117, 173–206 (1983). See also: M. J. Coster, B. A. LaMacchia, C.P. Schnorr, J. Stern: Improved low-density subset sum algorithms. J. Computational Complexity 2, 111–128 (1992)MathSciNetCrossRefGoogle Scholar
© Springer-Verlag Berlin Heidelberg 2006