Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm Abstract. The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest - NTRU - Document - PDFSEARCH.IO

First Page	Meta Content
	Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm Abstract. The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest Add to Reading List Document Date: 2009-10-16 07:35:09 Open Document File Size: 220,19 KB Share Result on Facebook

Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm Abstract. The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortestAdd to Reading List