30
30
55
30
30
30
30
30
A Note on Sphere Packing Bounds for Tuple Lattice Sieving
Proves upper bounds on k-irreducible unit vector set rates, yielding nearly tight asymptotics relevant to tuple lattice sieving in cryptanalysis.
The paper bounds the maximal asymptotic rate of k-irreducible sets of unit vectors via spherical code packing bounds. It shows R_k is sandwiched between (1/2 - o(1)) log2(k)/k and (1 + o(1)) log2(k)/k for large k. These almost-tight bounds inform subexponential complexity analyses of tuple lattice sieving, which underpins security estimates for lattice-based cryptography.
15
30
30
30
30
30
30
30
30
30
30
30
30
30
30
30
30
42
30
30
30
30
30
30
30
30
30
30
30
30