A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech

First Page		Document Content
Date: 2014-12-04 01:20:06 Lattice points Cryptography Computational number theory Linear algebra Quadratic forms Lattice problem Lattice reduction Lattice Lenstra–Lenstra–Lovász lattice basis reduction algorithm Algebra Mathematics Abstract algebra		A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 483,72 KB Share Document on Facebook

	Lattice Microbes Problem Solving Environment User’s Guide LM Version 2.3, pyLM Version 1.1 June 1, 2016 DocID: 1tLOH - View Document
	Justification of the lattice equation for a nonlinear elliptic problem with a periodic potential Dmitry Pelinovsky1 , Guido Schneider2 , and Robert MacKay3 1 3 DocID: 1qB93 - View Document
	Math 583D, Spring 2016 MWF 1:30-2:20 Integer Optimization and Lattices Thomas Rothvoss Content DocID: 1pYLI - View Document
	Lattice Cryptography: A White Paper Daniele Micciancio∗ March 16, 2010 1 DocID: 1pUoS - View Document
	Nearest lattice problem, diophantine approximation April 12, L´ aszl´ o Babai. On Lov´ DocID: 1pmsl - View Document