Forum: Factoring
2016-09-13, 21:11
|
|
Replies: 9
Views: 1,883
|
|
Forum: Miscellaneous Math
2014-03-04, 20:23
|
|
Replies: 21
Views: 2,245
|
|
Forum: Miscellaneous Math
2014-03-04, 18:44
|
|
Replies: 21
Views: 2,245
It's in the Reddit comment, not the paper. And...
It's in the Reddit comment, not the paper. And it's second-hand, as in "Some guy I know told me . . . ." Which is one of the things that makes me ask if this is for real. Not to mention the "add zero...
|
|
Forum: Miscellaneous Math
2014-03-04, 18:11
|
|
Replies: 21
Views: 2,245
New factoring "method"; is this for real?
This paper (http://arxiv.org/pdf/1402.5633v1.pdf) was mentioned on Reddit (http://www.reddit.com/r/crypto/comments/1zfsya/a_new_way_closing_in_on_oln4_n_oln2_n_factoring/) today, with a comment that...
|
|
Forum: Factoring
2013-06-11, 14:37
|
|
Replies: 5
Views: 1,378
|
|
Forum: Factoring
2013-06-10, 15:40
|
|
Replies: 5
Views: 1,378
Thanks for responding. I wasn't aware that the...
Thanks for responding. I wasn't aware that the incremental method was once used. Do you have a reference?
The sorting actually is free. The smooth function generates the primes in order, and the...
|
|
Forum: Factoring
2013-06-10, 01:40
|
|
Replies: 5
Views: 1,378
I have a question
Several integer factorization algorithms -- Dixon's method, continued fractions, quadratic sieve, number field sieve -- rely on a congruence of squares: if x2 == y2 (mod n), then gcd(x-y, n) is a...
|
|
Forum: Factoring
2012-10-31, 16:18
|
|
Replies: 11
Views: 2,997
|
|
Forum: Information & Answers
2011-07-14, 00:47
|
|
Replies: 0
Views: 3,048
Legendre's prime counting function
I am reading the discussion of the prime counting function in pages 10 through 34 of the second edition of Hans Riesel's book "Prime Numbers and Computer Methods for Factorization" and writing...
|
