Paper 2025/723

Time-Space Tradeoffs of Truncation with Preprocessing

Abstract

Truncation of cryptographic outputs is a technique that was recently introduced in Baldimtsi et al. [BCCK22]. The general idea is to try out many inputs to some cryptographic algorithm until the output (e.g. a public-key or some hash value) falls into some sparse set and thus can be compressed: by trying out an expected $2^k$ different inputs one will find an output that starts with $k$ zeros. Using such truncation one can for example save substantial gas fees on Blockchains where storing values is very expensive. While [BCCK22] show that truncation preserves the security of the underlying primitive, they only consider a setting without preprocessing. In this work we show that lower bounds on the time-space tradeoff for inverting random functions and permutations also hold with truncation, except for parameters ranges where the bound fails to hold for ''trivial'' reasons. Concretely, it's known that any algorithm that inverts a random function or permutation with range $$ making $$ queries and using $$ bits of auxiliary input must satisfy $$. This lower bound no longer holds in the truncated setting where one must only invert a challenge from a range of size $$, as now one can simply save the replies to all $$ challenges, which requires $$ bits and allows to invert with $$ query. We show that with truncation, whenever $$ is somewhat smaller than the $$ bits required to store the entire truncated function table, the known $$ lower bound applies.