Time-space tradeoffs of truncation with preprocessing

DOI10.4230/LIPICS.ITC.2025.4MaRDI QIDQ7299421zbMATH OpenFDO

Authors Krzysztof Pietrzak, Pengxiang Wang

Publication date 17 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2025.4

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A cryptanalytic time-memory trade-off
• Advances in Cryptology - CRYPTO 2003
• Beyond Hellman's time-memory trade-offs with applications to proofs of space
• Bit security as computational cost for winning games with high probability
• Lower bounds on the efficiency of generic cryptographic constructions
• On obfuscating point functions
• The Discrete Logarithm problem with preprocessing
• Time space tradeoffs for attacks against one-way functions and PRGs

This page was built for publication: Time-space tradeoffs of truncation with preprocessing

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