Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors

Yumi Sakemi, Kazushi Nishii, Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa

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

Abstract

Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the other hand, RSA cryptography has been widely used and is defined over a certain composite order as the modulus. In detail, it generally needs to be a product of two large prime numbers. In order to apply RSA-based techniques to pairing-based cryptography, the authors have proposed a method for generating ordinary pairing-friendly curves of such a composite order especially when the embedding degree k is equal to 3 and the order of curve is given as a polynomial of degree 2 with an integer variable. Then, as the next problem, its pairing calculation needs to be efficiently carried out. This paper shows the implementation of cross twisted Ate pairing using the obtained composite order curve and some experimental results.

Original languageEnglish
Title of host publicationProceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010
Pages552-557
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

Cryptography
Composite materials
Polynomials

Keywords

  • Composite order
  • Ordinary pairing-friendly elliptic curve
  • Pairing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Sakemi, Y., Nishii, K., Izuta, T., Nogami, Y., & Morikawa, Y. (2010). Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors. In Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010 (pp. 552-557). [5636267] https://doi.org/10.1109/NBiS.2010.89

Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors. / Sakemi, Yumi; Nishii, Kazushi; Izuta, Tetsuya; Nogami, Yasuyuki; Morikawa, Yoshitaka.

Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. p. 552-557 5636267.

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

Sakemi, Y, Nishii, K, Izuta, T, Nogami, Y & Morikawa, Y 2010, Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors. in Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010., 5636267, pp. 552-557, 13th International Conference on Network-Based Information Systems, NBiS 2010, Gifu, Japan, 9/14/10. https://doi.org/10.1109/NBiS.2010.89
Sakemi Y, Nishii K, Izuta T, Nogami Y, Morikawa Y. Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors. In Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. p. 552-557. 5636267 https://doi.org/10.1109/NBiS.2010.89
Sakemi, Yumi ; Nishii, Kazushi ; Izuta, Tetsuya ; Nogami, Yasuyuki ; Morikawa, Yoshitaka. / Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors. Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010. 2010. pp. 552-557
@inproceedings{93f0e2d1c21742f299fa9e91669c3ae9,
title = "Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors",
abstract = "Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the other hand, RSA cryptography has been widely used and is defined over a certain composite order as the modulus. In detail, it generally needs to be a product of two large prime numbers. In order to apply RSA-based techniques to pairing-based cryptography, the authors have proposed a method for generating ordinary pairing-friendly curves of such a composite order especially when the embedding degree k is equal to 3 and the order of curve is given as a polynomial of degree 2 with an integer variable. Then, as the next problem, its pairing calculation needs to be efficiently carried out. This paper shows the implementation of cross twisted Ate pairing using the obtained composite order curve and some experimental results.",
keywords = "Composite order, Ordinary pairing-friendly elliptic curve, Pairing",
author = "Yumi Sakemi and Kazushi Nishii and Tetsuya Izuta and Yasuyuki Nogami and Yoshitaka Morikawa",
year = "2010",
doi = "10.1109/NBiS.2010.89",
language = "English",
isbn = "9780769541679",
pages = "552--557",
booktitle = "Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010",

}

TY - GEN

T1 - Accelerating cross twisted Ate pairing with ordinary pairing friendly curve of composite order that has two large prime factors

AU - Sakemi, Yumi

AU - Nishii, Kazushi

AU - Izuta, Tetsuya

AU - Nogami, Yasuyuki

AU - Morikawa, Yoshitaka

PY - 2010

Y1 - 2010

N2 - Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the other hand, RSA cryptography has been widely used and is defined over a certain composite order as the modulus. In detail, it generally needs to be a product of two large prime numbers. In order to apply RSA-based techniques to pairing-based cryptography, the authors have proposed a method for generating ordinary pairing-friendly curves of such a composite order especially when the embedding degree k is equal to 3 and the order of curve is given as a polynomial of degree 2 with an integer variable. Then, as the next problem, its pairing calculation needs to be efficiently carried out. This paper shows the implementation of cross twisted Ate pairing using the obtained composite order curve and some experimental results.

AB - Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the other hand, RSA cryptography has been widely used and is defined over a certain composite order as the modulus. In detail, it generally needs to be a product of two large prime numbers. In order to apply RSA-based techniques to pairing-based cryptography, the authors have proposed a method for generating ordinary pairing-friendly curves of such a composite order especially when the embedding degree k is equal to 3 and the order of curve is given as a polynomial of degree 2 with an integer variable. Then, as the next problem, its pairing calculation needs to be efficiently carried out. This paper shows the implementation of cross twisted Ate pairing using the obtained composite order curve and some experimental results.

KW - Composite order

KW - Ordinary pairing-friendly elliptic curve

KW - Pairing

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

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

U2 - 10.1109/NBiS.2010.89

DO - 10.1109/NBiS.2010.89

M3 - Conference contribution

AN - SCOPUS:78650473583

SN - 9780769541679

SP - 552

EP - 557

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

ER -