Chinese lotto as an exhaustive code-breaking machine

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.<<ETX>>

[1]  Mark Horowitz,et al.  ATUM: a new technique for capturing address traces using microcode , 1986, ISCA '86.

[2]  Yale N. Patt,et al.  The use of microcode instrumentation for development, debugging and tuning of operating system kernels , 1988, SIGMETRICS 1988.

[3]  Jean-Jacques Quisquater,et al.  How Easy is Collision Search. New Results and Applications to DES , 1989, CRYPTO.

[4]  Whitfield Diffie,et al.  Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard , 1977, Computer.

[5]  Wen-mei W. Hwu,et al.  Benchmark characterization for experimental system evaluation , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.

[6]  Arjen K. Lenstra,et al.  Factoring by Electronic Mail , 1990, EUROCRYPT.

[7]  François Morain,et al.  Distributed Primality Proving and the Primality of (23539+1)/3 , 1991, EUROCRYPT.

[8]  Jean-Jacques Quisquater,et al.  Secret Distribution of Keys for Public-Key Systems , 1987, CRYPTO.

[9]  M. Conrad.  The lure of molecular computing: While marketable products seem decades away, researchers are crystallizing theories and devices that will give biological organisms the power to compute , 1986, IEEE Spectrum.

[10]  Henry M. Levy,et al.  On the use of benchmarks for measuring system performance , 1982, CARN.

[11]  Ralph Howard,et al.  Data encryption standard , 1987 .

[12]  E.S. Davidson,et al.  The effects of memory latency and fine-grain parallelism on Astronautics ZS-1 performance , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.

[13]  Jean-Jacques Quisquater,et al.  How Easy is Collision Search? Application to DES (Extended Summary) , 1990, EUROCRYPT.

[14]  Yvo Desmedt,et al.  Is There an ultimate Use of Cryptography? , 1986, CRYPTO.

[15]  Steve R. White.  Covert Distributed Processing with Computer Viruses , 1989, CRYPTO.

[16]  Robert P. Colwell,et al.  Instruction Sets and Beyond: Computers, Complexity, and Controversy , 1985, Computer.

[17]  James E. Smith,et al.  Characterizing computer performance with a single number , 1988, CACM.

[18]  Yvo Desmedt,et al.  Several Exhaustive Key Search Machines and DES , 1986, International Conference on the Theory and Application of Cryptographic Techniques.