kleinjung polynomial selection paper

Chris Card · 2009-10-05, 12:34

does anyone have an electronic copy (or link not behind a pay wall) to Kleinjung's paper "On polynomial selection for the general number field sieve"?

I have a copy on my PC at home, but I can't get to it until the weekend.

Chris

bsquared · 2009-10-05, 13:36

The slides from the CADO 08 presentation are here, although you probably already knew that.

Chris Card · 2009-10-05, 13:51

Quote:

Originally Posted by bsquared

The slides from the CADO 08 presentation are here, although you probably already knew that.

thanks but I need the gory details - I'm trying to debug my implementation.

Chris

jasonp · 2009-10-05, 15:54

The files area of the GGNFS yahoo group has a copy.

Note that reading the paper was no help at all in deciphering the core inner loops of the pol5 code. Thorsten's improved algorithm is much simpler to understand.

Chris Card · 2009-10-05, 16:50

Quote:

Originally Posted by jasonp

The files area of the GGNFS yahoo group has a copy.

Note that reading the paper was no help at all in deciphering the core inner loops of the pol5 code. Thorsten's improved algorithm is much simpler to understand.

I've not looked at the pol5 code as far as I remember - I just wrote an implementation based on the paper, which worked fine for quintics, but I was trying to get it working for quartics and didn't have the paper to hand to see what stupid thing I'd done wrong.

Chris

PS I've got a copy now.

2009-10-05, 12:34	#1
Chris Card Aug 2004 10000010₂ Posts	kleinjung polynomial selection paper does anyone have an electronic copy (or link not behind a pay wall) to Kleinjung's paper "On polynomial selection for the general number field sieve"? I have a copy on my PC at home, but I can't get to it until the weekend. Chris

2009-10-05, 15:54	#4
jasonp Tribal Bullet Oct 2004 3,541 Posts	The files area of the GGNFS yahoo group has a copy. Note that reading the paper was no help at all in deciphering the core inner loops of the pol5 code. Thorsten's improved algorithm is much simpler to understand. Last fiddled with by jasonp on 2009-10-05 at 15:54

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Polynomial selection	Max0526	NFS@Home	9	2017-05-20 08:57
msieve 1.52 with GPU polynomial selection	cgy606	Msieve	16	2016-10-06 14:16
Improved NFS polynomial selection	jasonp	Operation Kibibit	5	2014-09-07 11:02
2^877-1 polynomial selection	fivemack	Factoring	47	2009-06-16 00:24
Polynomial selection	CRGreathouse	Factoring	2	2009-05-25 07:55

2009-10-05, 13:36	#2
bsquared "Ben" Feb 2007 3·1,171 Posts	The slides from the CADO 08 presentation are here, although you probably already knew that.