A high-speed square root algorithm in extension fields

Hidehiro Katou; Feng Wang; Yasuyuki Nogami; Yoshitaka Morikawa

doi:10.1007/11927587_10

A high-speed square root algorithm in extension fields

Hidehiro Katou, Feng Wang, Yasuyuki Nogami, Yoshitaka Morikawa

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

A square root (SQRT) algorithm in GF(p^m) (m = r ₀r₁⋯ r_n-1-12^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 ^2d ), where most of the computations are performed in the corresponding subfields GF(p²ⁱ ) for 0 ≤ i ≤ d-1. Then the Frobenius mappings with an addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field GF(p ^m) are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. More specifically the Tonelli-Shanks algorithm and the proposed algorithm in GF(p²²), GF(p⁴⁴) and GF(p ⁸⁸) were implemented on a Pentium4 (2.6 GHz) computer using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerates the SQRT computation by 25 times in GF(p ²²), by 45 times in GF(p⁴⁴), and by 70 times in GF(p ⁸⁸), compared to the Tonelli-Shanks algorithm, which is supported by the evaluation of the number of computations.

Original language	English
Title of host publication	Information Security and Cryptology - ICISC 2006
Subtitle of host publication	9th International Conference, Proceedings
Publisher	Springer Verlag
Pages	94-106
Number of pages	13
ISBN (Print)	3540491120, 9783540491125
DOIs	https://doi.org/10.1007/11927587_10
Publication status	Published - Jan 1 2006
Event	ICISC 2006: 9th International Conference on Information Security and Cryptology - Busan, Korea, Republic of Duration: Nov 30 2006 → Dec 1 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4296 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	ICISC 2006: 9th International Conference on Information Security and Cryptology
Country	Korea, Republic of
City	Busan
Period	11/30/06 → 12/1/06

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11927587_10

Fingerprint Dive into the research topics of 'A high-speed square root algorithm in extension fields'. Together they form a unique fingerprint.

Cite this

Katou, H., Wang, F., Nogami, Y., & Morikawa, Y. (2006). A high-speed square root algorithm in extension fields. In Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings (pp. 94-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4296 LNCS). Springer Verlag. https://doi.org/10.1007/11927587_10

A high-speed square root algorithm in extension fields. / Katou, Hidehiro; Wang, Feng; Nogami, Yasuyuki; Morikawa, Yoshitaka.

Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. Springer Verlag, 2006. p. 94-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4296 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Katou, H, Wang, F, Nogami, Y & Morikawa, Y 2006, A high-speed square root algorithm in extension fields. in Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4296 LNCS, Springer Verlag, pp. 94-106, ICISC 2006: 9th International Conference on Information Security and Cryptology, Busan, Korea, Republic of, 11/30/06. https://doi.org/10.1007/11927587_10

Katou H, Wang F, Nogami Y, Morikawa Y. A high-speed square root algorithm in extension fields. In Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. Springer Verlag. 2006. p. 94-106. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11927587_10

Katou, Hidehiro ; Wang, Feng ; Nogami, Yasuyuki ; Morikawa, Yoshitaka. / A high-speed square root algorithm in extension fields. Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. Springer Verlag, 2006. pp. 94-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7ed1d5307b0d4fc9924f46ea0817511e,

title = "A high-speed square root algorithm in extension fields",

abstract = "A square root (SQRT) algorithm in GF(pm) (m = r 0r1⋯ rn-1-12d, ri: 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 2d ), where most of the computations are performed in the corresponding subfields GF(p2i ) for 0 ≤ i ≤ d-1. Then the Frobenius mappings with an addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field GF(p m) are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. More specifically the Tonelli-Shanks algorithm and the proposed algorithm in GF(p22), GF(p44) and GF(p 88) were implemented on a Pentium4 (2.6 GHz) computer using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerates the SQRT computation by 25 times in GF(p 22), by 45 times in GF(p44), and by 70 times in GF(p 88), compared to the Tonelli-Shanks algorithm, which is supported by the evaluation of the number of computations.",

author = "Hidehiro Katou and Feng Wang and Yasuyuki Nogami and Yoshitaka Morikawa",

year = "2006",

month = jan,

day = "1",

doi = "10.1007/11927587_10",

language = "English",

isbn = "3540491120",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "94--106",

booktitle = "Information Security and Cryptology - ICISC 2006",

note = "ICISC 2006: 9th International Conference on Information Security and Cryptology ; Conference date: 30-11-2006 Through 01-12-2006",

}

TY - GEN

T1 - A high-speed square root algorithm in extension fields

AU - Katou, Hidehiro

AU - Wang, Feng

AU - Nogami, Yasuyuki

AU - Morikawa, Yoshitaka

PY - 2006/1/1

Y1 - 2006/1/1

N2 - A square root (SQRT) algorithm in GF(pm) (m = r 0r1⋯ rn-1-12d, ri: 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 2d ), where most of the computations are performed in the corresponding subfields GF(p2i ) for 0 ≤ i ≤ d-1. Then the Frobenius mappings with an addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field GF(p m) are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. More specifically the Tonelli-Shanks algorithm and the proposed algorithm in GF(p22), GF(p44) and GF(p 88) were implemented on a Pentium4 (2.6 GHz) computer using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerates the SQRT computation by 25 times in GF(p 22), by 45 times in GF(p44), and by 70 times in GF(p 88), compared to the Tonelli-Shanks algorithm, which is supported by the evaluation of the number of computations.

AB - A square root (SQRT) algorithm in GF(pm) (m = r 0r1⋯ rn-1-12d, ri: 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 2d ), where most of the computations are performed in the corresponding subfields GF(p2i ) for 0 ≤ i ≤ d-1. Then the Frobenius mappings with an addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field GF(p m) are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. More specifically the Tonelli-Shanks algorithm and the proposed algorithm in GF(p22), GF(p44) and GF(p 88) were implemented on a Pentium4 (2.6 GHz) computer using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerates the SQRT computation by 25 times in GF(p 22), by 45 times in GF(p44), and by 70 times in GF(p 88), compared to the Tonelli-Shanks algorithm, which is supported by the evaluation of the number of computations.

UR - http://www.scopus.com/inward/record.url?scp=34547443654&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547443654&partnerID=8YFLogxK

U2 - 10.1007/11927587_10

DO - 10.1007/11927587_10

M3 - Conference contribution

AN - SCOPUS:34547443654

SN - 3540491120

SN - 9783540491125

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 94

EP - 106

BT - Information Security and Cryptology - ICISC 2006

PB - Springer Verlag

T2 - ICISC 2006: 9th International Conference on Information Security and Cryptology

Y2 - 30 November 2006 through 1 December 2006

ER -