Adleman-Manders-Miller Root Extraction Method Revisited

@inproceedings{Cao2011AdlemanMandersMillerRE,
  title={Adleman-Manders-Miller Root Extraction Method Revisited},
  author={Zhengjun Cao and Qian Sha and Xiao Fan},
  booktitle={Inscrypt},
  year={2011}
}
In 1977, Adleman, Manders and Miller had briefly described how to extend their square root extraction method to the general rth root extraction over finite fields, but not shown enough details. Actually, there is a dramatic difference between the square root extraction and the general rth root extraction because one has to solve discrete logarithms for rth root extraction. In this paper, we clarify their method and analyze its complexity. Our heuristic presentation is helpful to grasp the… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

On taking roots in finite fields

18th Annual Symposium on Foundations of Computer Science (sfcs 1977) • 1977
View 7 Excerpts
Highly Influenced

On the computation of square roots in finite fields, Designs

S. Müller
Codes and Cryptography, • 2004
View 1 Excerpt

Five Number-theoretic Algorithms

D. Shanks
Proc. 2nd Manitoba Conf., pp. 51–70. Numer. Math • 1972
View 1 Excerpt

Similar Papers

Loading similar papers…