
	Where results make sense

Topic: Carl Pomerance

	PlanetMath: Carl Pomerance
		Carl Pomerance (1944 -) American mathematician, discoverer of the quadratic sieve method for integer factorization, co-author with Richard Crandall of the seminal book Prime Numbers: A Computational Perspective.
		The greatest recognition for Pomerance, however, might be that the use of his quadratic sieve method cracked RSA-129.
		This is version 1 of Carl Pomerance, born on 2007-04-16.
	planetmath.org /encyclopedia/CarlPomerance.html (231 words)

	Carl Pomerance
		Pomerance and S.S. Wagstaff, Jr., Congressus Numerantium 37 (1983), 99-117.
		Pomerance, Proceedings of the Intenational Congress of Mathematicians, Zurich, Switzerland 1994, Birkhauser Verlag, Basel, 1995, pp.
		Smooth numbers and the quadratic sieve, C. Pomerance, to appear in the proceedings of an MSRI workshop, J. Buhler and P. Stevenhagen, eds.
	www.math.dartmouth.edu /~carlp (2315 words)

	[No title]
		\bib{1994/alford} \yr 1994 \mr 95k:11114 \by W. Alford \by Andrew Granville \by Carl Pomerance \paper There are infinitely many Carmichael numbers \jour Annals of Mathematics \issn 0003--486X \vol 139 \pages 703--722 \url http://cr.yp.to/\allowbreak bib/\allowbreak entries.html#\allowbreak 1994/alford \endref
		\bib{1995/alford} \yr 1995 \mr 96k:11152 \by W. Alford \by Carl Pomerance \paper Implementing the self-initializing quadratic sieve on a distributed network \inbook \cite{1995/vanderpoorten} \pages 163--174 \endref
		\bib{1992/balog} \yr 1992 \mr 92h:11075 \by Antal Balog \by Carl Pomerance \paper The distribution of smooth numbers in arithmetic progressions \jour Proceedings of the American Mathematical Society \issn 0002--9939 \vol 115 \pages 33--43 \endref
	cr.yp.to /bib/entries.html (10296 words)

	Quadratic sieve - Wikipedia, the free encyclopedia
		It is a general-purpose factorization algorithm, meaning that its running time depends solely on the size of the integer to be factored, and not on special structure or properties.
		It was invented by Carl Pomerance in 1981.
		The algorithm attempts to set up a congruence of squares modulo n (the integer to be factorized), which often leads to a factorization of n.
	en.wikipedia.org /wiki/Quadratic_sieve (2224 words)

	NUMBER THEORIST NAMES:P
		The Niven Lectures, (Carl Pomerance) March 21-23, 2005, University of British Columbia
		Primes, a computational perspective, C. Pomerance, R. Crandall, Springer 2000
		A Tale of Two Sieves, C. Pomerance, AMS Notices, December 1996
	www.mat.uniroma3.it /ntheory/names_p.html (532 words)

	Author Index
		On Optimal Play in the Game of Hex, Vol 4
		(with Carl Pomerance) On the Problem of Uniqueness for the Maximum Stirling Number(s) of the Second Kind, Vol 2
		(with Carl Pomerance) Corrigendum to Article A1, Volume 2(2002) (On the Problem of Uniqueness for the Maximum Stirling Number(s) of the Second Kind), Vol 5(1)
	www.integers-ejcnt.org /authorindex.html (5532 words)

Try your search on: Qwika (all wikis)