|
|
|
|
|
Priyanka Mukhopadhyay
In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in l??
l
p
norm (1=??=8
1
=
p
=
8
). The running time we obtain is better than existing provable sieving algorithms....
ver más
|
|
|
|
|