Integral lattices and their theta series

点击翻译按钮获取中文摘要

Lattice algorithms play a very important role in solving problems in algebra, number theory, combinatorics, optimisation and cryptography. Our proposed work will fill a major hole in current capabilities for computing with lattices. The enhanced ability to enumerate short vectors will have important applications to Diophantine equations, linear optimisation and also to understanding the security of cryptosystems based on the difficulty of finding a shortest vector. The work on theta series should result in the first algorithm for this problem. This will also find many applications including to the construction of spherical codes and designs.