66 reputation
3
bio website
location
age
visits member for 2 years, 9 months
seen Mar 16 '12 at 14:59

Mar
2
comment Is the new preprint “An Algorithm For Factoring Integers” by Yingpu Deng and Yanbin Pan worth reading?
The additional modulo operation of $(x + a) ^ n \bmod (x^r - 1, n)$ might come from the deterministic primality test.
Mar
2
comment How are primes generated for RSA?
For more background about why using lists of primes would be bad see this blogentry and the paper "Ron was wrong, Whit is right". How big primes can be found is described in the answers to this question.
Mar
1
comment Is the new preprint “An Algorithm For Factoring Integers” by Yingpu Deng and Yanbin Pan worth reading?
What do you think the intended audience is? People with plenty of time?
Mar
1
comment Is the new preprint “An Algorithm For Factoring Integers” by Yingpu Deng and Yanbin Pan worth reading?
My strong concerns towards the paper come from the tables in the appendix. They only have tiny examples where calling FAC(n, 1) etc. small made little sense as they are about the size of the square root of the prime factors. But of course as the numbers are so tiny, FAC(n, 1) has also the size of $\log(n)^2$ times a little constant...