Affiliation:
1. 8888 University Dr, Burnaby
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献