Yoshitaka Morikawa

Learn More
A square root (SQRT) algorithm in GF (p m) (m = r 0 r 1 · · · r n−1 2 d , r i : odd prime, d >0: integer) is proposed in this paper. First, the Tonelli-Shanks algorithm is modified to compute the inverse SQRT in GF (p 2 d), where most of the computations are performed in the corresponding sub-fields GF (p 2 i) for 0 i d − 1. Then the Frobenius mappings with(More)