A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Subgroup refinement algorithms for root finding in GF (q). SIAM J. Comput. 21 (1992), 228--239. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Computing Frobenius Maps And Factoring Polynomials - Gathen, Shoup (1992) (10 citations) (Correct)
.... many other methods used in modern polynomial factorization, including trace computation (McEliece 1969, Ben Or 1981, Camion 1983) reduction to root finding via resultants (Berlekamp 1970) and distinguishing roots by their order (Moenck 1977, von zur Gathen 1987, Mignotte Schnorr 1988, Menezes et al. 1992). Arwin s algorithm is based on the following fact (see Lidl Niederreiter 1983, Theorem 3.20) Fact 3.3. For d 1, the polynomial x q d Gamma x 2 F q [x] is the product of the monic irreducible polynomials in F q [x] whose degree divides d. Algorithm 3.4. Distinct degree factorization. ....
A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Subgroup refinement algorithms for root finding in GF (q). SIAM J. Comput. 21 (1992), 228--239.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC