Our algorithm precomputes a primitive rs-th root of unity where s is the largest positive integer satisfying rsjq 1, and is applicable for the cases when s is small.
The proposed algorithm requires one exponentiation for the r-th root computation and is favorably compared to the existing algorithms..
Our algorithm precomputes a primitive rs-th root of unity where s is the largest positive integer satisfying rsjq 1, and is applicable for the cases when s is small.
The proposed algorithm requires one exponentiation for the r-th root computation and is favorably compared to the existing algorithms.
Our algorithm precomputes a primitive rs-th root of unity where s is the largest positive integer satisfying rsjq 1, and is applicable for the cases when s is small.
The proposed algorithm requires one exponentiation for the r-th root computation and is favorably compared to the existing algorithms..
Our algorithm precomputes a primitive rs-th root of unity where s is the largest positive integer satisfying rsjq 1, and is applicable for the cases when s is small.
The proposed algorithm requires one exponentiation for the r-th root computation and is favorably compared to the existing algorithms.