Square root algorithm in F^sub q^ for q [identical to] 2^sup s^ + 1 (mod2^sup s+1^)
Presented is a square root algorithm in F^sub q^ which generalises Atkins's square root algorithm [see reference 6] for q ≡ 5 (mod 8) and Müller's algorithm [see reference 7] for q ≡ 9 (mod 16). The presented algorithm precomputes a primitive 2^sup s^-th root of unity ξ where s is the larg...
Saved in:
Published in | Electronics letters Vol. 49; no. 7; p. 1 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Stevenage
John Wiley & Sons, Inc
28.03.2013
|
Online Access | Get full text |
Cover
Loading…
Summary: | Presented is a square root algorithm in F^sub q^ which generalises Atkins's square root algorithm [see reference 6] for q ≡ 5 (mod 8) and Müller's algorithm [see reference 7] for q ≡ 9 (mod 16). The presented algorithm precomputes a primitive 2^sup s^-th root of unity ξ where s is the largest positive integer satisfying 2^sup s^ |q - 1, and is applicable for the d algor cases when s is small. The proposed algorithm requires one exponentiation for square root computation and is favourably compared with the algorithms of Atkin, Müuller and Kong et al. [PUBLICATION ABSTRACT] |
---|---|
ISSN: | 0013-5194 1350-911X |