network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 3 months |
| seen | Mar 16 '12 at 14:59 | |
| stats | profile views | 1 |
|
Mar 2 |
awarded | Editor |
|
Mar 2 |
revised |
Is the new preprint “An Algorithm For Factoring Integers” by Yingpu Deng and Yanbin Pan worth reading? added reference to AKS-test |
|
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... |
|
Mar 1 |
awarded | Student |
|
Feb 29 |
asked | Is the new preprint “An Algorithm For Factoring Integers” by Yingpu Deng and Yanbin Pan worth reading? |
|
Feb 1 |
awarded | Teacher |
|
Feb 1 |
answered | Why RSA encryption key is based on modulo(phi(n)) rather than modulo n |
