Chinese lotto as an exhaustive code-breaking machine

@article{Quisquater1991ChineseLA,
  title={Chinese lotto as an exhaustive code-breaking machine},
  author={Jean-Jacques Quisquater and Yvo Desmedt},
  journal={Computer},
  year={1991},
  volume={24},
  pages={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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
12 Citations
2 References
Similar Papers

Similar Papers

Loading similar papers…