NFS: Sieving the norm over ideals vs. integers
Hello, me again lol.
In Briggs paper, I am told to find prime ideals (r,p) such that f(r) = 0 mod p, and each prime ideal is "responsible" for dividing the norm, that is, each prime ideal has an entry on the matrix. Currently, my implementation instead just uses primes in Z to sieve the norm, so the norms are smooth over Z primes, and each prime has an entry on the matrix. Is there a difference between two approaches? Some NFS papers say that I'm supposed to look for smooth norms, others say it has be smooth over prime ideals. Is the splitting of primes to different prime ideals just another technique to keep the sieved values smaller (since one prime is used multiple times), or will it break the algorithm if this isn't done? 
I just read Pomerance again, it turns out that no, the two are not equivalent. It's an explicit example in page 283. You can ignore this post now, I apologize.

You found this out, but ideals matter because each individual ideal must occur an even number of times during the NFS algebraic square root, not just the prime that the ideal lies over. If the norm of a given relation contains a factor p, only one of the ideals over p in the algebraic factor base gets its count incremented. For an algebraic polynomial of degree d there are as many as d different entries in the algebraic factor base for each prime p, and you must sieve them individually.

All times are UTC. The time now is 20:16. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2022, Jelsoft Enterprises Ltd.