Time-memory-processor trade-offs

DOI10.1109/18.6030MaRDI QIDQ3796743zbMATH OpenOpenAlexFDO

Authors Hamid R. Amirazizi, Martin Edward Hellman

Publication date 1988

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4f3d9d64e4881979cbf0c4db3b154cd8e4d0e80f

zbMATH Keywords

cryptanalysisparallel processingknapsackexhaustive searchmultiple encryptiontime-memory trade-offssorting/switching network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Searching and sorting (68P10)

Recommendations

• Processor-time tradeoffs in PRAM simulations
• New Applications of Time Memory Data Tradeoffs
• Architecture technique trade-offs using mean memory delay time
• scientific article; zbMATH DE number 1305455
• Time-work tradeoffs for parallel algorithms
• scientific article; zbMATH DE number 3940742
• Efficient computation of optimal space-time performance curves for memory hierarchies

Cited in

(10)

• Improving implementable meet-in-the-middle attacks by orders of magnitude
• The full cost of cryptanalytic attacks
• Efficient dissection of bicomposite problems with cryptanalytic applications
• A cryptanalytic time-memory trade-off
• The Effect of Time Constraints on Scaled Speedup
• Time-memory trade-off attack on the GSM A5/1 stream cipher using commodity GPGPU (extended abstract)
• A parallel time-memory-processor tradeoff \(O(2^{5n/6})\) for knapsack-like NP-complete problems
• From multiple encryption to knapsacks -- efficient dissection of composite problems
• Computing (and Life) Is All about Tradeoffs
• Improving a solution's quality through parallel processing

This page was built for publication: Time-memory-processor trade-offs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796743)