By Topic

Time-memory-processor trade-offs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. R. Amirazizi ; NEC America Inc., San Jose, CA, USA ; M. E. Hellman

It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C s, the cost per solution, and Cm, the cost of the machine: doubling Cm increases the solution rate by a factor of four, halving Cs. 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 of cryptanalysis, the knapsack problem, and multiple encryption are discussed

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 3 )