Hi All,

I am given a prime p and another number k. I want an efficient algorithm to find the kth root of unity in the field Z/p. Can someone tell me how to do this?

Please don't close this thread. I have done a fairly extensive search on the Web using Google, but so far I haven't found a single description of a concrete procedure that can be implemented. So, please let me know if you know one.

Thanks! codegeek