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.
1 stories, newest first · one card per story
Proves upper bounds on k-irreducible unit vector set rates, yielding nearly tight asymptotics relevant to tuple lattice sieving in cryptanalysis.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views