Basis reduction for layered lattices
Torreão Dassen, E.
Citation
Torreão Dassen, E. (2011, December 20). Basis reduction for layered lattices.
Retrieved from https://hdl.handle.net/1887/18264
Version: Not Applicable (or Unknown)
License: Leiden University Non-exclusive license Downloaded from: https://hdl.handle.net/1887/18264
Note: To cite this publication please use the final published version (if applicable).
Bibliography
[1] N. Bourbaki. Alg`ebre, volume 1 of ´El´ements de math´ematique. Springer, 1981.
[2] J. Buchmann and A. Peth˝o. Computation of independent units in number fields by Dirichlet’s method, volume 229 of Lecture notes in computer science. Springer, 1986.
[3] H. Cohen. A course in computational algebraic number theory, volume 138 of Graduate texts in mathematics. Springer, 1993.
[4] I. Efrat. Valuations, orderings and Milnor K-theory, volume 124 of Math- ematical surveys and monographs. AMS, 2006.
[5] E. Kaltofen. On the complexity of finding short vectors in integer lattices.
In Proceedings of EUROCAL ’83, pages 236–244. 1983.
[6] S. Koshi. Vector spaces with linear order. Comment. Math. Special Issue, 2:183–187, 1979.
[7] S. Lang. Algebra, volume 211 of Graduate texts in mathematics. Springer, 2002.
[8] A. K. Lenstra, H. W. Lenstra Jr., and L. Lov´asz. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515–534, 1982.
[9] H. W. Lenstra Jr. Flags and lattice basis reduction. In R. M. Miro-Roig C. Casacuberta, J. Verdera, and S. Xambo-Deschamps, editors, 3rd Euro- pean congress on mathematics, pages 37–52. Springer-Verlag, Barcelona, 2001.
97
98 BIBLIOGRAPHY
[10] H. W. Lenstra Jr. Lattices. In J. P. Buhler and P. Stevenhagen, editors, Surveys in algorithmic number theory, pages 127–182. MSRI publications, 2009.
[11] P. Nguyen and B. Vall´ee, editors. The LLL algorithm: survey and appli- cations. Information security and cryptography. Springer, 2009.
[12] M. Pohst. A modification of the LLL reduction algorithm. J. Symbolic Comput., 4(1):123–127, 1987.
[13] A. Schrijver. Theory of linear and integer programming. Wiley interscience series in discrete mathematics and optimization. Wiley, 1998.
Curriculum Vitae
Personalia
Naam Erwin Lavalli`ere Torre˜ao Dassen
Geboren 14 December 1979, te Campina Grande, Brazili¨e.
Opleidingen
2006 - 2010 Promovendus bij Prof. Dr. H. W. Lenstra Jr., Mathematisch Instituut, Universiteit Leiden.
2003 - 2005 Master of Science: Honors Magister in Algebra, Federal University of Santa Catarina, Brazil.
1999 - 2002 Bachelor degree in Mathematics and Scientific Computing, Federal University of Santa Catarina, Brazil.
Huidige werkgever
Centrum voor Wiskunde en Informatica (CWI), Amterdam.
