Posts tagged
svp
-
Classical complexity reductions among hard lattice problems
The difficulty of solving a hard lattice problem depends significantly on the choice of its parameters. One cannot meaningfully discuss cryptographic constructions — especially FHE schemes — without first understanding the complexity landscape of lattice problems. This post describes several classical (i.e., non-quantum) reductions among different lattice problems. If you only care about the results,...