Hi All,
I am given a prime p$p$ and another number k$k$ ($k$ is likely a power of $2$). I want an efficient algorithm to find the kth$k$th root of unity in the field Z/p$\mathbb{F}_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