Faster LLL-type reduction of lattice bases Arnold Neumaier Damien Stehlé Universität Wien, Austria

First Page		Document Content
Date: 2016-05-12 05:35:58 Computational number theory Lattice points Linear algebra Algebra LenstraLenstraLovsz lattice basis reduction algorithm Lattice NC Determinant		Faster LLL-type reduction of lattice bases Arnold Neumaier Damien Stehlé Universität Wien, Austria Add to Reading List Source URL: perso.ens-lyon.fr Download Document from Source Website File Size: 354,79 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