An Efficient Square Root Computation in Finite Fields GF(p2d)

Authors:
Feng Wang;Yasuyuki Nogami;Yoshitaka Morikawa
Affiliations:
The authors are with the Faculty of Engineering, Okayama University, Okayama-shi, 700-8530 Japan. E-mail: wangfeng@trans.cne.okayama-u.ac.jp;The authors are with the Faculty of Engineering, Okayama University, Okayama-shi, 700-8530 Japan. E-mail: wangfeng@trans.cne.okayama-u.ac.jp;The authors are with the Faculty of Engineering, Okayama University, Okayama-shi, 700-8530 Japan. E-mail: wangfeng@trans.cne.okayama-u.ac.jp
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2005

Citing 0
Cited 2

A high-speed square root algorithm in extension fields

ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Implementing cryptographic pairings

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on developing a square root (SQRT) algorithm in finite fields GF(p2d) (d â聣楼 0). Examining the Smart algorithm, a well-known SQRT algorithm, we can see that there is some computation overlap between the Smart algorithm and the quadratic residue (QR) test, which must be implemented before a SQRT computation. It makes the Smart algorithm inefficient. In this paper, we propose a new QR test and a new SQRT algorithm in GF(p2d), in which not only there is no computation overlap, but also most of computations required for the proposed SQRT algorithm in GF(p2d) can be implemented in the corresponding subfields GF(p2d-i) for 1 â聣陇 i â聣陇 d, which yields many reductions in the computational time and complexity. The computer simulation also shows that the proposed SQRT algorithm is much faster than the Smart algorithm.