| Document Date: 2012-07-19 15:34:39
Open Document File Size: 268,60 KBShare Result on Facebook
City ENSICAEN / / Company NTL / Enumeration We / / Country France / Israel / / Facility library NTL / Tel Aviv University / / IndustryTerm fundamental algorithms / reduction algorithm / polynomial time algorithms / basic algorithms / extreme pruning algorithm / polynomial-time algorithms / lattice reduction algorithms / reduction algorithms / depth-first search / important algorithm / standalone algorithms / main reduction algorithms / search region / search tree / possible solutions / exhaustive search / lattice algorithms / / Organization Blavatnik School of Computer Science / Tel Aviv University / / Position SVP / / Technology celebrated LLL algorithm / reduction algorithms / cryptography / good CVPP algorithm / pruning algorithm / enumeration algorithm / CVPP algorithm / lattice reduction algorithms / standalone algorithms / lattice algorithms / polynomial-time algorithms / main reduction algorithms / theoretically important algorithm / fundamental algorithms / polynomial time algorithms / simulation / Schnorr-Euchner algorithm / reduction algorithm / CVPP algorithms / extreme pruning algorithm / / URL http /
SocialTag |
Lattice Enumeration using Extreme Pruning Nicolas Gama1 , Phong Q. Nguyen2 , and Oded Regev3 1 GREYC and ENSICAEN, France. INRIA and ENS, France. http://www.di.ens.fr/~pnguyen/.