Integer minimum polynomial

• Do

  • Choose some prime pi

Until Threshold

• Sharp bound, C, on the coefficients of the minimal polynomials
  • By ||A||1, ||A||?, or ovals of Cassini

• Compute the minimum polynomial over a field
  • modulo some prime number pi (Wiedemann’s algorithm)

• If sufficiently many pi (product of the pi > integer value)
  • Reconstruct the integer coefficients, or just the valence, via Chinese remaindering

Diapositive précédente

Diapositive suivante

Revenir à la première diapositive

Afficher la version graphique