Back to Results
First PageMeta Content
Lattice points / Abstract algebra / Matrix theory / Quadratic forms / Lattice / Geometry of numbers / Vector space / Determinant / Linear independence / Algebra / Mathematics / Linear algebra


Algorithms for the Densest Sub-Lattice Problem Daniel Dadush∗ Daniele Micciancio† November 16, 2012
Add to Reading List

Document Date: 2013-01-22 17:01:51


Open Document

File Size: 508,85 KB

Share Result on Facebook

City

La Jolla / Atlanta / /

Country

United States / /

/

Facility

University of California / /

IndustryTerm

reduction algorithm / enumerative algorithm / exponential time algorithms / faster algorithms / potential applications / polynomial space algorithms / lattice reduction algorithms / basis reduction algorithms / approximation algorithm / computational tool / give algorithms / to our algorithm / gigantic exhaustive search / exhaustive search algorithm / machinery / possible potential applications / volume product / nontrivial algorithm / case solutions / transference reduction algorithm / search space / exhaustive search / /

Organization

National Science Foundation / K πW / University of California / San Diego / /

/

Position

SVP / /

Product

Pentax K-x Digital Camera / /

ProvinceOrState

California / /

Technology

basis reduction algorithms / cryptography / 2012 Abstract We give algorithms / transference reduction algorithm / lattice reduction algorithms / exponential time algorithms / polynomial space algorithms / approximation algorithm / previous algorithms / Rankin reduction algorithm / 1 Algorithm / 3.2 Algorithm / LLL reduction algorithm / 2 exhaustive search algorithm / integer programming algorithms / DSP / DSP algorithm / k-DSP algorithm / /

SocialTag