The lure of molecular computing
IEEE Spectrum
Is there an ultimate use of cryptography?
Proceedings on Advances in cryptology---CRYPTO '86
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How easy is collision search? Application to DES
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Distributed primality proving and the primality of (23539+1)/3
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Convert distributed processing with computer viruses
CRYPTO '89 Proceedings on Advances in cryptology
Secret Distribution of Keys for Public-Key Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Designing encryption algorithms for real people
NSPW '94 Proceedings of the 1994 workshop on New security paradigms
ACM Computing Surveys (CSUR)
On the effectiveness of TMTO and exhaustive search attacks
IWSEC'06 Proceedings of the 1st international conference on Security
A brief survey of research jointly with jean-jacques quisquater
Cryptography and Security
Useful password hashing: how to waste computing cycles with style
Proceedings of the 2013 workshop on New security paradigms workshop
| Hi-index | 4.10 |
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.