, ? 1) = 1 then there exists a unique nth-root ? of ? in Z/pZ, for any ? ? Z\{1}

G. Let and ,. .. ,

, U = T .M 2. As T .M 2 = T .M 2 , we obtain that U = T .M 2. We have T .M 2 ? L, so there exists V =

N. E. Mrabet and N. Gama, Efficient multiplication over extension fields, WAIFI. Lecture Notes in Computer Science, vol.7369, pp.136-151, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01197178

N. `-egre, C. Plantard, and T. , Efficient modular arithmetic in adapted modular number system using lagrange representation, Information Security and Privacy, p.13

A. Conference, ACISP, pp.463-477, 2008.

T. Plantard, Arithmétique modulaire pour la cryptographie, 2005.