mersenneforum.org line sieving references
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2013-10-02, 14:35 #1 Raman Noodles     "Mr. Tuch" Dec 2007 Chennai, India 23518 Posts line sieving references Lattice sieving has been explained within "Development of Number Field Sieve" Question → Is the sieving method as explained as within "Prime Numbers - A computational perspective" line sieving? If not, where could I find out furthermore about line sieving? Thanks to you Merci (within French language) :smile:
 2013-10-03, 00:22 #2 jasonp Tribal Bullet     Oct 2004 353610 Posts Yes, Crandall and Pomerance describe line sieving. The thesis here has a good description of line sieving, along with a complete small example.
2013-10-03, 02:58   #3
LaurV
Romulan Interpreter

Jun 2011
Thailand

33×347 Posts

Quote:
 Originally Posted by jasonp Yes, Crandall and Pomerance describe line sieving. The thesis here has a good description of line sieving, along with a complete small example.
The thesis is very good (especially chapter 6!), it is taking you through all the steps of "factorization", from its basic to the most complex, so it is a must to read, but read it with caution, it has few "small omissions" an lost ends. For example, right in the beginning, according to the definition 2.2 on page 6, there are no prime numbers. I can prove all numbers are not prime. (I did not say "composite"). (for a proof just take b=-ka for any integer k>0)

2013-10-03, 10:45   #4
henryzz
Just call me Henry

"David"
Sep 2007
Cambridge (GMT/BST)

25·3·61 Posts

Quote:
 Originally Posted by LaurV The thesis is very good (especially chapter 6!), it is taking you through all the steps of "factorization", from its basic to the most complex, so it is a must to read, but read it with caution, it has few "small omissions" an lost ends. For example, right in the beginning, according to the definition 2.2 on page 6, there are no prime numbers. I can prove all numbers are not prime. (I did not say "composite"). (for a proof just take b=-ka for any integer k>0)
That is picking holes too much. It is a minor mistake though. It should limit b to the positive integers rather than the integers.

2013-10-03, 12:17   #5
R.D. Silverman

Nov 2003

11101001001002 Posts

Quote:
 Originally Posted by LaurV The thesis is very good
As a superficial survey paper, I agree with the above statement.

However, it is nothing more than that. It appears to have been done
as a Master's thesis. But it contains no original work and the presentations
omit many (important!) details.

All of Chapter 2 should be omitted. It contains material that should be
assumed for a graduate level thesis. Any potential reader would know
the material.

I would not accept it as a Master's Thesis if I were asked to review it.
It is too superficial and elementary.

 2013-10-03, 12:18 #6 jasonp Tribal Bullet     Oct 2004 353610 Posts PGNFS was the only place I could find that went through all the steps for computing the NFS algebraic square root using the brute force method. There are optimizations that it doesn't mention, but those optimizations appear in 'The Development of the Number Field Sieve'
2013-10-03, 12:47   #7
LaurV
Romulan Interpreter

Jun 2011
Thailand

33×347 Posts

Quote:
 Originally Posted by R.D. Silverman As a superficial survey paper, I agree with the above statement.
Well, correction to what I said: the thesis is very good for my level of knowledge. You won't expect all of us to know the things you know, in that case we won't need any thesis to read..

Last fiddled with by LaurV on 2013-10-03 at 12:48 Reason: s/ant/any

2013-10-03, 14:37   #8
Raman
Noodles

"Mr. Tuch"
Dec 2007
Chennai, India

3·419 Posts

Quote:
 Originally Posted by R.D. Silverman I would not accept it as a Master's Thesis if I were asked to review it. It is too superficial and elementary.
I think the student would have discussed with the mentor about structure of his master's thesis before writing it. If it was not worthy as a master's thesis, the mentor would have stopped him before itself. Perhaps this was assigned by his mentor to be written as a master's thesis.

Quote:
 Originally Posted by R.D. Silverman It appears to have been done as a Master's thesis. But it contains no original work and the presentations omit many (important!) details.
Suppose you are a Master's student, and you have some interesting problem in your mind which you want to explore on your own , and feel confident that you can come up with new, interesting, creative ideas, not sure if important.

And then would you go with that for your Master's thesis, or will you go for your mentor's input? He gives you a problem he has in his mind that you find it difficult to come up with new innovative ideas, or is based on writing a report, a summary of what is already known. I think that you will respect your mentor's ideas, as he has experience with importance of problems chosen for master's thesis. As a student, you will have no idea as how far your ideas are worthwhile.

I have decided to put Ph.D on hold, I am doing M.Phil right now. After to my M.Tech degree. Afterwards to after towards switching disciplines. I think it is not a good idea to rush to a Ph.D thesis which will turn out into low quality if I work towards commitment for some monthly stipend, compulsory submission after provided deadline.

Good idea is to read targetted books, attend targetted course work, first submit small papers into some technical journal, conference first, gain some experience, afterwards go towards Ph.D thesis, which will be merger of all work. I think it is not a good idea to rush to a Ph.D thesis. I aim submitting some paper with my mentor towards some technical journal. This is integer factorization, as I have topic of quadratic forms representation - uses some of ideas from integer factorization as topic

Last fiddled with by Raman on 2013-10-03 at 15:00

 2013-10-03, 16:01 #9 chris2be8     Sep 2009 2,027 Posts I think this thread should be in the Factoring forum, not the NFSNET Discussion forum since it has nothing to do with NFSNET. Could some moderator please oblige? Chris Last fiddled with by chris2be8 on 2013-10-03 at 16:15 Reason: Found the difference between a forum and a sub-forum.
 2013-10-03, 16:46 #10 jasonp Tribal Bullet     Oct 2004 24·13·17 Posts ok. The novelty required in a Master's thesis varies widely, and by field. My own involved a lot of original code but was just a performance comparison of various new cryptographic schemes. Last fiddled with by jasonp on 2013-10-03 at 16:58
2013-10-03, 21:48   #11
R.D. Silverman

Nov 2003

22·5·373 Posts

Quote:
 Originally Posted by jasonp ok. The novelty required in a Master's thesis varies widely, and by field. My own involved a lot of original code but was just a performance comparison of various new cryptographic schemes.
Perhaps. But I will assume that you did your own analysis, rather than
just quoting work done by others. And you wrote your own code.

The thesis under discussion was nothing more than a compilation of
information from other sources. While academic standards vary,
a simple transcription of information available from other sources
does not meet what I consider to be a reasonable standard for a

 Similar Threads Thread Thread Starter Forum Replies Last Post gjmccrac Programming 1 2014-11-27 01:09 JHansen NFSNET Discussion 9 2010-06-09 19:25 S485122 Software 4 2007-01-28 04:02 hbock Lone Mersenne Hunters 2 2004-01-05 11:19 xilman NFSNET Discussion 5 2003-10-13 18:36

All times are UTC. The time now is 21:25.

Wed Apr 14 21:25:42 UTC 2021 up 6 days, 16:06, 0 users, load averages: 2.27, 2.35, 2.34