このエントリーをはてなブックマークに追加
ID 14157
Eprint ID
14157
フルテキストURL
著者
Wang, Feng Department of Communication Network Engineering Okayama University
Nogami, Yasuyuki Department of Communication Network Engineering Okayama University
Morikawa, Yoshitaka Department of Communication Network Engineering Okayama University
抄録
In this paper, we focus on developing a high-speed square root (SQRT) algorithm required for an elliptic curve cryptosystem. Examining Smart algorithm, the previously well-known SQRT algorithm, we can see that there is a lot of computation overlap in Smart algorithm and the quadratic residue (QR) test, which must be implemented prior to a SQRT computation. It makes Smart algorithm inefficient. The essence of our proposition is thus to present a new QR test and an efficient SQRT algorithm to avoid all the overlapping computations. The authors devised a SQRT algorithm for which most of the data required have been computed in the proposed QR test. Not only there is no computation overlap in the proposed algorithm and the proposed QR test, but also in the proposed algorithm over GF(p(2)) (4 | p − 1) some computations can be executed in GF(p); whereas in Smart algorithm over GF(p(2)) all the computations must be executed in GF(p(2)). These yield many reductions in the computational time and complexity. We implemented the two QR tests and the two SQRT algorithms over GF(pm) (m=1, 2) in C++ language with NTL (Number Theory Library) on Pentium4 (2.6GHz), where the size of p is around 160 bits. The computer simulations showed that the proposed QR test and the proposed algorithm over GF(p(m)) were about 2 times faster than the conventional QR test and Smart algorithm over GF(p(m)).
発行日
2005-01
出版物タイトル
Memoirs of the Faculty of Engineering, Okayama University
39巻
1号
出版者
Faculty of Engineering, Okayama University
出版者(別表記)
岡山大学工学部
開始ページ
82
終了ページ
92
ISSN
0475-0071
NCID
AA10699856
資料タイプ
紀要論文
言語
English
論文のバージョン
publisher
査読
無し
Eprints Journal Name
mfe