Pseudo 8-sparse multiplication for efficient ate-based pairing on Barreto-Naehrig curve

Yuki Mori, Shoichi Akagi, Yasuyuki Nogami, Masaaki Shirase

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

According to some recent implementation reports on Ate-based pairings such as optimal ate pairing with Barreto-Naehrig curve whose embedding degree is 12, sparse multiplication accelerates Miller's loop calculation in a pairing calculation. Especially, 7-sparse multiplication is available when the implementation uses affine coordinates, where 7-sparse means that the multiplicand or multiplier has 7 zeros among 12 coefficients. This paper extends it to pseudo 8-sparse multiplication. Then, some experimental results together with theoretic calculation costs are shown in order to evaluate its efficiency.

Original languageEnglish
Pages (from-to)186-198
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8365 LNCS
DOIs
Publication statusPublished - 2014

Fingerprint

Pairing
Multiplication
Curve
Accelerate
Multiplier
Costs
Evaluate
Zero
Experimental Results
Coefficient

Keywords

  • Barreto-Naehrig curve
  • pairing
  • sparse multiplication

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

@article{0b4bf28ab92d432082f738c833d469f3,
title = "Pseudo 8-sparse multiplication for efficient ate-based pairing on Barreto-Naehrig curve",
abstract = "According to some recent implementation reports on Ate-based pairings such as optimal ate pairing with Barreto-Naehrig curve whose embedding degree is 12, sparse multiplication accelerates Miller's loop calculation in a pairing calculation. Especially, 7-sparse multiplication is available when the implementation uses affine coordinates, where 7-sparse means that the multiplicand or multiplier has 7 zeros among 12 coefficients. This paper extends it to pseudo 8-sparse multiplication. Then, some experimental results together with theoretic calculation costs are shown in order to evaluate its efficiency.",
keywords = "Barreto-Naehrig curve, pairing, sparse multiplication",
author = "Yuki Mori and Shoichi Akagi and Yasuyuki Nogami and Masaaki Shirase",
year = "2014",
doi = "10.1007/978-3-319-04873-4_11",
language = "English",
volume = "8365 LNCS",
pages = "186--198",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Pseudo 8-sparse multiplication for efficient ate-based pairing on Barreto-Naehrig curve

AU - Mori, Yuki

AU - Akagi, Shoichi

AU - Nogami, Yasuyuki

AU - Shirase, Masaaki

PY - 2014

Y1 - 2014

N2 - According to some recent implementation reports on Ate-based pairings such as optimal ate pairing with Barreto-Naehrig curve whose embedding degree is 12, sparse multiplication accelerates Miller's loop calculation in a pairing calculation. Especially, 7-sparse multiplication is available when the implementation uses affine coordinates, where 7-sparse means that the multiplicand or multiplier has 7 zeros among 12 coefficients. This paper extends it to pseudo 8-sparse multiplication. Then, some experimental results together with theoretic calculation costs are shown in order to evaluate its efficiency.

AB - According to some recent implementation reports on Ate-based pairings such as optimal ate pairing with Barreto-Naehrig curve whose embedding degree is 12, sparse multiplication accelerates Miller's loop calculation in a pairing calculation. Especially, 7-sparse multiplication is available when the implementation uses affine coordinates, where 7-sparse means that the multiplicand or multiplier has 7 zeros among 12 coefficients. This paper extends it to pseudo 8-sparse multiplication. Then, some experimental results together with theoretic calculation costs are shown in order to evaluate its efficiency.

KW - Barreto-Naehrig curve

KW - pairing

KW - sparse multiplication

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

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

U2 - 10.1007/978-3-319-04873-4_11

DO - 10.1007/978-3-319-04873-4_11

M3 - Article

AN - SCOPUS:84894479131

VL - 8365 LNCS

SP - 186

EP - 198

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -