\begin{thebibliography}{10}

\bibitem{PKCGOLD}
S.~Goldwasser.
\newblock New directions in cryptography: twenty some years later (or
  cryptograpy and complexity theory: a match made in heaven).
\newblock In {\em Proceedings of the 38th Annual Symposium on Foundations of
  Computer Science}, page 314. IEEE Computer Society, 1997.

\bibitem{PKCDH}
W.~Diffie and M.~Hellman.
\newblock New directions in cryptography.
\newblock {\em IEEE Trans. Inf. Theor.}, 22(6):644--654.

\bibitem{AJTAI}
M.~Ajtai.
\newblock Generating hard instances of lattice problems (extended abstract).
\newblock In {\em In Proceedings of the Twenty-Eighth Annual ACM Symposium on
  the Theory of Computing}, pages 99--108, 1996.

\bibitem{COMPLEX1}
D.~Johnson.
\newblock Handbook of theoretical computer science.
\newblock pages 67--161. MIT Press, 1990.

\bibitem{COMPLEX2}
S.~Arora and B.~Barak.
\newblock {\em Computational Complexity: A Modern Approach}.
\newblock Cambridge University Press, New York, NY, USA, 1st edition, 2009.

\bibitem{DWORK1}
C.~Dwork.
\newblock Lattices and their application to cryptography.
\newblock Lecture Notes, 1998.
\newblock \url{http://theory.stanford.edu/~csilvers/cs359/}.

\bibitem{NGUYEN1}
P.~Q. Nguyen.
\newblock {\em Hermite's Constant and Lattice Algorithms}.
\newblock Information Security and Cryptography. Springer, 2009.

\bibitem{BASE1}
T.~Laarhoven, J.~van~de Pol, and B.~Weger.
\newblock Solving hard lattice problems and the security of lattice-based
  cryptosystems.
\newblock Cryptology ePrint Archive, Report 2012/533, 2012.
\newblock \url{http://eprint.iacr.org/}.

\bibitem{BASIS1}
Geometry of numbers: Determinant of the lattice and the fundamental
  parallelepiped.
\newblock Number Theory Reading Group, 2008.
\newblock \url{http://numbertheoryreadinggroup.wordpress.com/2008/04/24/}.

\bibitem{CHALLENGE}
Lattice challenge.
\newblock University of Technology of Darmstadt.
\newblock \url{http://www.latticechallenge.org/}.

\bibitem{SVP1}
Department of Computer Science and Engineering, University of California.
\newblock {\em The Geometry of Lattice Cryptography}, 2011.

\bibitem{POL1}
J.~van~de Pol.
\newblock Lattice-based criptography.
\newblock Master's thesis, Department of Mathematics and Computer Science,
  Eindhoven University of Technology, 2011.

\bibitem{AJHARD}
M.~Ajtai.
\newblock The shortest vector problem in l2 is np-hard for randomized
  reductions (extended abstract).
\newblock In {\em Proceedings of the thirtieth annual ACM symposium on Theory
  of computing}, pages 10--19. ACM, 1998.

\bibitem{SEBCRIPT}
J.~Valença.
\newblock {\em Introdução à Segurança da Informação, Códigos e
  Criptografia}.
\newblock Departamento de Informática, Universidade do Minho, 2012.

\bibitem{INTER}
D.~Micciancio and S.~Goldwasser.
\newblock {\em Complexity of Lattice Problems: a cryptographic perspective},
  volume 671 of {\em The Kluwer International Series in Engineering and
  Computer Science}.
\newblock Kluwer Academic Publishers, Boston, Massachusetts, 2002.

\bibitem{ENUMPRUN1}
C.~Schnorr, H.~Hörner, and J.~Wolfgang.
\newblock Attacking the chor-rivest cryptosystem by improved lattice reduction.
\newblock Springer-Verlag, 1995.

\bibitem{ENUMPRUN2}
N.~Gama, P.~Nguyen, and O.~Regev.
\newblock Lattice enumeration using extreme pruning.
\newblock In {\em Advances in Cryptology - Proceedings of EUROCRYPT '10},
  volume 6110 of {\em LNCS}. Springer, 2010.

\bibitem{SIEVE}
D.~Micciancio and P.~Voulgaris.
\newblock Faster exponential time algorithms for the shortest vector problem.
\newblock In {\em Proceedings of the Twenty-First Annual ACM-SIAM Symposium on
  Discrete Algorithms}, SODA '10. Society for Industrial and Applied
  Mathematics, 2010.

\bibitem{AJTSIEVE}
M.~Ajtai, R.~Kumar, and D.~Sivakumar.
\newblock A sieve algorithm for the shortest lattice vector problem.
\newblock In {\em In STOC}. ACM, 2001.

\bibitem{NGSIEVE}
P.~Nguyen and T.~Vidick.
\newblock Sieve algorithms for the shortest vector problem are practical.
\newblock {\em J. of Mathematical Cryptology}, 2(2), 2008.

\bibitem{WANSIEVE}
X.~Wang, C.~Tian M.~Liu, and J.~Bi.
\newblock Improved nguyen-vidick heuristic sieve algorithm for shortest vector
  problem.
\newblock In {\em Proceedings of the 6th ACM Symposium on Information, Computer
  and Communications Security}. ACM, 2011.

\bibitem{AJTAIDWORK}
M.~Ajtai and C.~Dwork.
\newblock A public-key cryptosystem with worst-case/average-case equivalence.
\newblock pages 284--293, 1997.

\bibitem{GGH}
O.~Goldreich, S.~Goldwasser, and S.~Halevi.
\newblock Public-key cryptosystems from lattice reduction problems.
\newblock pages 112--131. Springer-Verlag, 1996.

\bibitem{BASE2}
D.~Micciancio and O.~Regev.
\newblock Lattice based cryptography.
\newblock In {\em Encyclopedia of Cryptography and Security}. 2005.

\bibitem{DSFIAT}
V.~Lyubashevsky.
\newblock Fiat-shamir with aborts: Applications to lattice and factoring-based
  signatures.
\newblock In {\em ASIACRYPT}, pages 598--616, 2009.

\bibitem{MICHASH}
D.~Micciancio.
\newblock Generalized compact knapsaks, cyclic lattices, and efficient one-way
  functions.
\newblock {\em Computational Complexity}, 16(4):365--411, 2007.

\bibitem{SWIFFT}
V.~Lyubashevsky, D.~Micciancio, C.~Peikert, and A.~Rosen.
\newblock Swifft: A modest proposal for fft hashing.

\bibitem{LYUMIC}
V.~Lyubashevsky and D.~Micciancio.
\newblock Asymptotically efficient lattice-based digital signatures.

\end{thebibliography}
