5 citations · 15 across the 25 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2011
Note on fast division algorithm for polynomials using Newton iteration
Zhengjun Cao, Hanyue Cao
The classical division algorithm for polynomials requires operations for inputs of size . Using reversal technique and Newton iteration, it can be improved to $O({M}(n)…
cs.SC2011★ 1 cited
Adleman-Manders-Miller Root Extraction Method Revisited
Zhengjun Cao, Qian Sha, Xiao Fan
In 1977, Adleman, Manders and Miller had briefly described how to extend their square root extraction method to the general th root extraction over finite fields, but not shown…
cs.SC2011
Improvement Of Barreto-Voloch Algorithm For Computing th Roots Over Finite Fields
Zhengjun Cao, Xiao Fan
Root extraction is a classical problem in computers algebra. It plays an essential role in cryptosystems based on elliptic curves. In 2006, Barreto and Voloch proposed an algorithm…