Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs

DOI10.1007/11818175_1zbMath1161.94384OpenAlexW1857473325MaRDI QIDQ5756640

Elad Barkan, Eli Biham, Adi Shamir

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_1

zbMATH Keywords

lower boundhidden stateHellmanCryptanalysisRainbowtime/memory/data tradeoffrigorousstateful random graphTime/memory tradeoff

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (24)

Comparison of perfect table cryptanalytic tradeoff algorithms ⋮ Analysis of Rainbow Tables with Fingerprints ⋮ The function-inversion problem: barriers and opportunities ⋮ A comparison of cryptanalytic tradeoff algorithms ⋮ An analysis of chain characteristics in the cryptanalytic TMTO method ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Revisiting time-space tradeoffs for function inversion ⋮ Quantum time/memory/data tradeoff attacks ⋮ New proofs for NMAC and HMAC: security without collision resistance ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ The cost of false alarms in Hellman and rainbow tradeoffs ⋮ Some results on Fruit ⋮ Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers ⋮ Success probability of the Hellman trade-off ⋮ Time–Memory Trade-Off Attack on the GSM A5/1 Stream Cipher Using Commodity GPGPU ⋮ Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks ⋮ Исследование сложности метода радужных таблиц с маркерами цепочек ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ Analysis of the Parallel Distinguished Point Tradeoff ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ Analysis of the perfect table fuzzy rainbow tradeoff ⋮ Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited

This page was built for publication: Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs