Abstract
It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs be- tween time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C,, the cost per solution, and C,,,, the cost of the machine: doubling C,,, increases the solution rate by a factor of four, halving C,. The machine which achieves this has an unusual architecture, with a number of processors sharing a large memory through a sorting/switching network. The implications for cryptanalysis, the knapsack problem, and multiple encryption are discussed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
