• DocumentCode
    2083147
  • Title

    Galois groups and factoring polynomials over finite fields

  • Author

    Rónyai, Lajos

  • Author_Institution
    Hungarian Acad. of Sci., Budapest, Hungary
  • fYear
    1989
  • fDate
    30 Oct-1 Nov 1989
  • Firstpage
    99
  • Lastpage
    104
  • Abstract
    Let p be a prime and F be a polynomial with integer coefficients. Suppose that the discriminant of F is not divisible by p, and denote by m the degree of the splitting field of F over Q and by L the maximal size of the coefficients of F. Then, assuming the generalized Riemann hypothesis (GRH), it is shown that the irreducible factors of F modulo p can be found in deterministic time polynomial in deg F, m, log p, and L . As an application, it is shown that it is possible under GRH to solve certain equations of the form nP=R, where R is a given and P is an unknown point of an elliptic curve defined over GF(p) in polynomial time (n is counted in unary). An elliptic analog of results obtained recently about factoring polynomials with the help of smooth multiplicative subgroups of finite field is proved
  • Keywords
    computational complexity; group theory; Galois groups; deterministic time polynomial; discriminant; elliptic analog; elliptic curve; factoring polynomials; finite fields; generalized Riemann hypothesis; integer coefficients; irreducible factors; maximal size; prime; smooth multiplicative subgroups; splitting field; Algebra; Elliptic curves; Encoding; Equations; Galois fields; Hydrogen; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1989., 30th Annual Symposium on
  • Conference_Location
    Research Triangle Park, NC
  • Print_ISBN
    0-8186-1982-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1989.63462
  • Filename
    63462