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

	On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th DocID: 1uruF - View Document
	A Computational Introduction to Number Theory and Algebra (Version 2) Victor Shoup This PDF document contains hyperlinks, and one may navigate through it by clicking on theorem, definition, lemma, equation, and page n DocID: 1tTlW - View Document
	Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN Joint work with: DocID: 1r2Hf - View Document
	Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER, DocID: 1r1z1 - View Document
	Volume201, number I ,2,3,4 CHEMICAL PHYSICS LETTERS 1 January 1993 DocID: 1qWFj - View Document