Alex Sprintson

An asymptotically matching lower bound of this secrecy measure for $r=o(n)$ is proved, showing that both sampling methods are asymptotically optimal among input-independent additive masks of rank at most $r$, even when secret invertible transformations are allowed.