Papers
On r-th Root Extraction Algorithm in Fq for q=lrs+1(mod rs+1) with 0<l<r and Small s
- Authorkyung-Ah Shim, Gook Hwa Cho, Soonhak Kwon
- JournalIEEE Transactions on Computers 65(1). 322-325 (2016
- Classification of papersSCI
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.