Rigorous Time/Space Trade-offs for Inverting Functions
From MaRDI portal
Publication:4943846
DOI10.1137/S0097539795280512zbMath0941.68002MaRDI QIDQ4943846
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
cryptographyrandom graphscryptanalysisrandomized algorithmsone-way functionshashing data encryption standard
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Randomized algorithms (68W20)
Related Items (14)
Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound ⋮ Random oracles and non-uniformity ⋮ The function-inversion problem: barriers and opportunities ⋮ Time and space efficient collinearity indexing ⋮ Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions ⋮ 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 ⋮ 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 ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Time–Memory Trade-Off Attack on the GSM A5/1 Stream Cipher Using Commodity GPGPU ⋮ Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
This page was built for publication: Rigorous Time/Space Trade-offs for Inverting Functions
