Adleman-Manders-Miller root extraction method revisited
From MaRDI portal
(Redirected from Publication:4899196)
Abstract: 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 enough details. Actually, there is a dramatic difference between the square root extraction and the general th root extraction because one has to solve discrete logarithms for th root extraction. In this paper, we clarify their method and analyze its complexity. Our heuristic presentation is helpful to grasp the method entirely and deeply.
Recommendations
- Efficient computation of roots in finite fields
- Taking roots over high extensions of finite fields
- Trace expression of \(r\)-th root over finite field
- On the computation of square roots in finite fields
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
Cited in
(9)- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
- On the Cipolla-Lehmer type algorithms in finite fields
- Improving the Pocklington and Padró-Sáez cube root algorithm
- A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
- Trace expression of \(r\)-th root over finite field
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm
- On the computation of r-th roots in finite fields
- Root extraction in finite abelian groups
- New results on the -hiding assumption and factoring related RSA moduli
This page was built for publication: Adleman-Manders-Miller root extraction method revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899196)