POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS
Seunghwan Chang, Bihtnara Kim, Hyang-Sook Lee · Journal of the Korean Mathematical Society · 2015
Computing square, cube and n-th roots in general, in finite fields, are important computational problems with significant applications to cryptography. One interesting approach to computational problems is by using polynomial representations. Agou, Del $\acute{e}$ eglise and Nicolas proved results concerning the lower bounds for the length of polynomials representing square roots modulo a prime p. We generalize the results by considering n-th roots over finite fields for arbitrary n > 2.