|
2015-01-11, 12:51
|
#1 |
|
Apr 2014
Marlow, UK
23·7 Posts |
Cyclotomic Polynomial Factoring methods
Could anyone tell me whether ECM renders Cyclotomic Polynomial Factoring methods obsolete (other than p-1, as it is a constant factor faster than ECM if it succeeds, I believe)?
Or, is there a significant possibility that for some k and N=pq, PHI_k(p) might be smooth where ECM finds no results? Are there any industrial-strength implementations of Cyclotomic Polynomial Factoring for values of k where the degree of PHI_k(p) > 2? (Sorry if this is a stupid question - I'm just enjoying learning about these methods at the moment...) |
|
|
|
2015-01-11, 14:40
|
#2 | |
Nov 2003
22×5×373 Posts |
Quote:
Last fiddled with by R.D. Silverman on 2015-01-11 at 14:40 |
|
|
|
|
|
2015-01-11, 18:31
|
#3 | |
|
Apr 2014
Marlow, UK
23×7 Posts |
Quote:
|
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Polynomials defining the same field as cyclotomic polynomial order 5 | carpetpool | Abstract Algebra & Algebraic Number Theory | 0 | 2017-04-19 20:33 |
| Polynomial whose coefficients add up to n defining Cyclotomic field K. | carpetpool | Miscellaneous Math | 3 | 2017-04-07 02:15 |
| Cyclotomic primes (degree>=5) | Batalov | And now for something completely different | 0 | 2016-06-21 21:02 |
| Can discrete logarithms / factoring be done in P (i.e., deterministic polynomial time)? | Raman | Factoring | 1 | 2016-05-23 13:44 |
| Cyclotomic Phi | plandon | Math | 22 | 2009-07-29 18:59 |
