Affine-evasive sets modulo a prime

Our result resolves one of the two main open questions in [1]. It improves the rate of non-malleable codes against affine tampering over Fp from log⁡log⁡p to a constant, and consequently the rate for non-malleable codes against split-state tampering for n-bit messages is improved from n6log7⁡n to n6.