Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies

Kenta Nekado, Tatsuya Yuasa, Yasuyuki Nogami, Yoshitaka Morikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Many public-key cryptographers have recently focused on cryptographic schemes based on pairing, which is a bilinear map from two elliptic curve groups to a group in an extension field. In order to provide efficient pairings, several kinds of pairing-friendly curves have been proposed. Since most of the pairing-friendly curves are defined over a certain extension field, arithmetic operations in extension field should be carried out efficiently. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in 2-nd tower field available for various pairingfriendly curves.

Original languageEnglish
Title of host publicationProceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010
Pages569-574
Number of pages6
DOIs
Publication statusPublished - 2010
Event13th International Conference on Network-Based Information Systems, NBiS 2010 - Gifu, Japan
Duration: Sep 14 2010Sep 16 2010

Other

Other13th International Conference on Network-Based Information Systems, NBiS 2010
CountryJapan
CityGifu
Period9/14/109/16/10

Fingerprint

Towers

Keywords

  • All one polynomial field
  • Barreto-naehrig curve
  • Cyclic vecoter multiplication algorithm
  • Freeman curve
  • Miyaji-nakabayashi-takano curve

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Nekado, K., Yuasa, T., Nogami, Y., & Morikawa, Y. (2010). Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies. In Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010 (pp. 569-574). [5635542] https://doi.org/10.1109/NBiS.2010.93

Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies. / Nekado, Kenta; Yuasa, Tatsuya; Nogami, Yasuyuki; Morikawa, Yoshitaka.

Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. p. 569-574 5635542.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nekado, K, Yuasa, T, Nogami, Y & Morikawa, Y 2010, Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies. in Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010., 5635542, pp. 569-574, 13th International Conference on Network-Based Information Systems, NBiS 2010, Gifu, Japan, 9/14/10. https://doi.org/10.1109/NBiS.2010.93
Nekado K, Yuasa T, Nogami Y, Morikawa Y. Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies. In Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. p. 569-574. 5635542 https://doi.org/10.1109/NBiS.2010.93
Nekado, Kenta ; Yuasa, Tatsuya ; Nogami, Yasuyuki ; Morikawa, Yoshitaka. / Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies. Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. pp. 569-574
@inproceedings{8d23bf6485b04371b2bf37e35602690d,
title = "Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies",
abstract = "Many public-key cryptographers have recently focused on cryptographic schemes based on pairing, which is a bilinear map from two elliptic curve groups to a group in an extension field. In order to provide efficient pairings, several kinds of pairing-friendly curves have been proposed. Since most of the pairing-friendly curves are defined over a certain extension field, arithmetic operations in extension field should be carried out efficiently. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in 2-nd tower field available for various pairingfriendly curves.",
keywords = "All one polynomial field, Barreto-naehrig curve, Cyclic vecoter multiplication algorithm, Freeman curve, Miyaji-nakabayashi-takano curve",
author = "Kenta Nekado and Tatsuya Yuasa and Yasuyuki Nogami and Yoshitaka Morikawa",
year = "2010",
doi = "10.1109/NBiS.2010.93",
language = "English",
isbn = "9780769541679",
pages = "569--574",
booktitle = "Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010",

}

TY - GEN

T1 - Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies

AU - Nekado, Kenta

AU - Yuasa, Tatsuya

AU - Nogami, Yasuyuki

AU - Morikawa, Yoshitaka

PY - 2010

Y1 - 2010

N2 - Many public-key cryptographers have recently focused on cryptographic schemes based on pairing, which is a bilinear map from two elliptic curve groups to a group in an extension field. In order to provide efficient pairings, several kinds of pairing-friendly curves have been proposed. Since most of the pairing-friendly curves are defined over a certain extension field, arithmetic operations in extension field should be carried out efficiently. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in 2-nd tower field available for various pairingfriendly curves.

AB - Many public-key cryptographers have recently focused on cryptographic schemes based on pairing, which is a bilinear map from two elliptic curve groups to a group in an extension field. In order to provide efficient pairings, several kinds of pairing-friendly curves have been proposed. Since most of the pairing-friendly curves are defined over a certain extension field, arithmetic operations in extension field should be carried out efficiently. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in 2-nd tower field available for various pairingfriendly curves.

KW - All one polynomial field

KW - Barreto-naehrig curve

KW - Cyclic vecoter multiplication algorithm

KW - Freeman curve

KW - Miyaji-nakabayashi-takano curve

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

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

U2 - 10.1109/NBiS.2010.93

DO - 10.1109/NBiS.2010.93

M3 - Conference contribution

AN - SCOPUS:78650431916

SN - 9780769541679

SP - 569

EP - 574

BT - Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010

ER -