CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee

First Page		Document Content
Date: 2005-03-19 07:30:03 Integer factorization algorithms Mathematics Computing Quadratic sieve Software engineering NC General number field sieve Pure Euclidean algorithm		CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 165,18 KB Share Document on Facebook

	An alternative approach to Freiman’s theorem in p-groups Matthew C. H. Tointon∗ Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, DocID: 1xVmO - View Document
	RJ 09:0 Counterpoint A UNITY proof with pure nondeterminism Rajeev Joshi DocID: 1xUH6 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Lecture 6, Thurs Feb 2: Mixed States So far we’ve only talked about pure states (i.e., isolated quantum systems), but you can also have quantum superposition layered together with regular, old probabilistic uncer DocID: 1xTZp - View Document
	HIGH DIMENSIONAL EXPANDERS ALEXANDER LUBOTZKY Abstract. Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence an DocID: 1xTsJ - View Document