Photo by Dan Cristian Pădureț on Unsplash

kth root of n (mod p)

--

What is the 7th root of 2 (mod 13)? Well, the answer is 11, and I will show you how we get this. In this article we will solve the kth root of n (modulo p) and find the result:

For this we need to find the value of k so that: n^k (mod p)=x, and using the Extended Euclidean method. Note, it will only work when gcd(k,p−1) is equal to 1.

Normal roots

--

--

Prof Bill Buchanan OBE FRSE
ASecuritySite: When Bob Met Alice

Professor of Cryptography. Serial innovator. Believer in fairness, justice & freedom. Based in Edinburgh. Old World Breaker. New World Creator. Building trust.