Asymptotics for the standard block size in primal lattice attacks: second order, formally verified

ePrint Report: Asymptotics for the standard block size in primal lattice attacks: second order, formally verified

Daniel J. Bernstein

Many proposals of lattice-based cryptosystems estimate security levels by following a recipe introduced in the New Hope proposal. This recipe, given a lattice dimension n, modulus q, and standard deviation s, outputs a "primal block size" β and a security level growing linearly with β. This β is minimal such that some κ satisfies ((n+κ)s^2+1)^{1/2} < (d/β)^{1/2} δ^{2β−d−1} q^{κ/d}, where d …

attacks block daniel eprint report hope order proposals recipe report security size standard verified