본문 바로가기 주메뉴 바로가기
검색 검색영역닫기 검색 검색영역닫기 ENGLISH 메뉴 전체보기 메뉴 전체보기

논문

On r-th Root Extraction Algorithm in Fq for q=lrs+1(mod rs+1) with 0

  • 저자kyung-Ah Shim, Gook Hwa Cho, Soonhak Kwon
  • 학술지IEEE Transactions on Computers 65(1). 322-325
  • 등재유형
  • 게재일자(2016)

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.

이 페이지에서 제공하는 정보에 대해 만족하십니까?