The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1991 vol.24)
pp: 14-22
ABSTRACT
<p>It is demonstrated that some problems can be solved inexpensively using widely distributed computers instead of an expensive supercomputer. This is illustrated by discussing how to make a simple fault-tolerant exhaustive code-breaking machine. The solution, which uses distributed processors is based on some elementary concepts of probability theory (lotto). The need for communication between processors is almost nil. Two approaches-deterministic and random-are compared. How to hide such a machine and how to build larger versions are discussed.</p>
CITATION
Jean-Jacques Quisquater, Yvo G. Desmedt, "Chinese Lotto as an Exhaustive Code-Breaking Machine", Computer, vol.24, no. 11, pp. 14-22, November 1991, doi:10.1109/2.116847
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool