Abstract
Abstract A deterministic algorithm to factorize polynomials in GF(pm )[X] into irreducible factors over GF(pm ) (p prime, m>1) is proposed. The main idea is the use of two trace functions to define a new set of factorizing polynomials. The method appears efficient when p is a small prime; the degree m of extension may be large.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
