Abstract
We present a new algorithm for performing linear Hensel lifting of bivariate polynomials over a finite field F p with p elements. It lifts n monic, univariate polynomials to recover the factors of a polynomial A ( x , y ) ∈ F p [ x , y ] which is monic in x , and bounded by degrees d x = deg( A , x ) and d y = deg( A , y ). Our algorithm improves upon Bernardin's algorithm in [1] and reduces the cost from [EQUATION] to [EQUATION]. Experimental results show that our algorithm works efficiently for large degree polynomials.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
