the creators of the ring based learning with errors (rlwe) basis for cryptography believe that an important feature of these algorithms based on ring-learning with errors is their provable reduction to known hard problems. the signature described below has a provable reduction to the shortest vector problem in an ideal lattice. this means that if an attack can be found on the ring-lwe cryptosystem then a whole class of presumed hard computational problems will have a solution.