Abstract
Recently, pairing-based cryptographies such as ID-based cryptography and group signature have been studied. For their implementations, pairings such as Xate pairing and R-ate pairing are efficient. In order to make pairing calculations faster, it is important to make not only pairing algorithms but also arithmetic operations in the definition field efficient. Thus, in several kinds of ordinary pairing-friendly curves, this paper focuses on Freeman curve that enables fast pairing-based cryptographies. This paper proposes ultimately an customized multiplication algorithm in the extension field for Freeman curve, and then shows some implementation results of Xate pairing and R-ate pairing with Freeman curve.
| Original language | English |
|---|---|
| Title of host publication | IEEE Region 10 Annual International Conference, Proceedings/TENCON |
| Pages | 773-778 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 2010 |
| Event | 2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka, Japan Duration: Nov 21 2010 → Nov 24 2010 |
Other
| Other | 2010 IEEE Region 10 Conference, TENCON 2010 |
|---|---|
| Country | Japan |
| City | Fukuoka |
| Period | 11/21/10 → 11/24/10 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Science Applications
Cite this
Ultimately customized multiplication algorithm in the extension field for Xate and R-ate Pairing with Freeman curve. / Nekado, Kenta; Nogami, Yasuyuki; Morikawa, Yoshitaka.
IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. p. 773-778 5686591.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Ultimately customized multiplication algorithm in the extension field for Xate and R-ate Pairing with Freeman curve
AU - Nekado, Kenta
AU - Nogami, Yasuyuki
AU - Morikawa, Yoshitaka
PY - 2010
Y1 - 2010
N2 - Recently, pairing-based cryptographies such as ID-based cryptography and group signature have been studied. For their implementations, pairings such as Xate pairing and R-ate pairing are efficient. In order to make pairing calculations faster, it is important to make not only pairing algorithms but also arithmetic operations in the definition field efficient. Thus, in several kinds of ordinary pairing-friendly curves, this paper focuses on Freeman curve that enables fast pairing-based cryptographies. This paper proposes ultimately an customized multiplication algorithm in the extension field for Freeman curve, and then shows some implementation results of Xate pairing and R-ate pairing with Freeman curve.
AB - Recently, pairing-based cryptographies such as ID-based cryptography and group signature have been studied. For their implementations, pairings such as Xate pairing and R-ate pairing are efficient. In order to make pairing calculations faster, it is important to make not only pairing algorithms but also arithmetic operations in the definition field efficient. Thus, in several kinds of ordinary pairing-friendly curves, this paper focuses on Freeman curve that enables fast pairing-based cryptographies. This paper proposes ultimately an customized multiplication algorithm in the extension field for Freeman curve, and then shows some implementation results of Xate pairing and R-ate pairing with Freeman curve.
UR - http://www.scopus.com/inward/record.url?scp=79951627873&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79951627873&partnerID=8YFLogxK
U2 - 10.1109/TENCON.2010.5686591
DO - 10.1109/TENCON.2010.5686591
M3 - Conference contribution
SN - 9781424468904
SP - 773
EP - 778
BT - IEEE Region 10 Annual International Conference, Proceedings/TENCON
ER -