Adleman-Manders-Miller root extraction method revisited

Authors:
Zhengjun Cao;Qian Sha;Xiao Fan
Affiliations:
Department of Mathematics, Shanghai University, Shanghai, China;Department of Mathematics, Shanghai University, Shanghai, China;Department of Mathematics, Shanghai University, Shanghai, China
Venue:
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2011

Citing 6
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Modern Computer Algebra

Modern Computer Algebra
On the Computation of Square Roots in Finite Fields

Designs, Codes and Cryptography
A computational introduction to number theory and algebra

A computational introduction to number theory and algebra
Efficient Computation of Roots in Finite Fields

Designs, Codes and Cryptography
On taking roots in finite fields

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adleman, Manders and Miller had mentioned 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 method entirely and deeply.