This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Chinese Lotto as an Exhaustive Code-Breaking Machine
November 1991 (vol. 24 no. 11)
pp. 14-22

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.

Citation:
Jean-Jacques Quisquater, Yvo G. Desmedt, "Chinese Lotto as an Exhaustive Code-Breaking Machine," Computer, vol. 24, no. 11, pp. 14-22, Nov. 1991, doi:10.1109/2.116847
Usage of this product signifies your acceptance of the Terms of Use.