Skew frobenius map and efficient scalar multiplication for pairing-based cryptography

Yumi Sakemi; Yasuyuki Nogami; Katsuyuki Okeya; Hidehiro Kato; Yoshitaka Morikawa

doi:10.1007/978-3-540-89641-8_16

Skew frobenius map and efficient scalar multiplication for pairing-based cryptography

Yumi Sakemi, Yasuyuki Nogami, Katsuyuki Okeya, Hidehiro Kato, Yoshitaka Morikawa

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

19 Citations (Scopus)

Abstract

This paper considers a new skew Frobenius endomorphism with pairing-friendly elliptic curve defined over prime field . Then, using the new skew Frobenius map, an efficient scalar multiplication method for pairing-friendly elliptic curve is shown. According to the simulation result, a scalar multiplication by the proposed method with multi-exponentiation technique is about 40% faster than that by plain binary method.

Original language	English
Title of host publication	Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings
Pages	226-239
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-540-89641-8_16
Publication status	Published - 2008
Event	7th International Conference on Cryptology and Network Security, CANS 2008 - Hong-Kong, China Duration: Dec 2 2008 → Dec 4 2008

Publication series

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

Other

Other	7th International Conference on Cryptology and Network Security, CANS 2008
Country/Territory	China
City	Hong-Kong
Period	12/2/08 → 12/4/08

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-89641-8_16

Cite this

Sakemi, Y., Nogami, Y., Okeya, K., Kato, H., & Morikawa, Y. (2008). Skew frobenius map and efficient scalar multiplication for pairing-based cryptography. In Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings (pp. 226-239). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5339 LNCS). https://doi.org/10.1007/978-3-540-89641-8_16

Skew frobenius map and efficient scalar multiplication for pairing-based cryptography. / Sakemi, Yumi; Nogami, Yasuyuki; Okeya, Katsuyuki et al.
Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings. 2008. p. 226-239 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5339 LNCS).

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

Sakemi, Y, Nogami, Y, Okeya, K, Kato, H & Morikawa, Y 2008, Skew frobenius map and efficient scalar multiplication for pairing-based cryptography. in Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5339 LNCS, pp. 226-239, 7th International Conference on Cryptology and Network Security, CANS 2008, Hong-Kong, China, 12/2/08. https://doi.org/10.1007/978-3-540-89641-8_16

Sakemi Y, Nogami Y, Okeya K, Kato H, Morikawa Y. Skew frobenius map and efficient scalar multiplication for pairing-based cryptography. In Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings. 2008. p. 226-239. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-89641-8_16

Sakemi, Yumi ; Nogami, Yasuyuki ; Okeya, Katsuyuki et al. / Skew frobenius map and efficient scalar multiplication for pairing-based cryptography. Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings. 2008. pp. 226-239 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{930f9229ccec480da06ba24f881eaeda,

title = "Skew frobenius map and efficient scalar multiplication for pairing-based cryptography",

abstract = "This paper considers a new skew Frobenius endomorphism with pairing-friendly elliptic curve defined over prime field . Then, using the new skew Frobenius map, an efficient scalar multiplication method for pairing-friendly elliptic curve is shown. According to the simulation result, a scalar multiplication by the proposed method with multi-exponentiation technique is about 40% faster than that by plain binary method.",

author = "Yumi Sakemi and Yasuyuki Nogami and Katsuyuki Okeya and Hidehiro Kato and Yoshitaka Morikawa",

year = "2008",

doi = "10.1007/978-3-540-89641-8_16",

language = "English",

isbn = "3540896406",

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

pages = "226--239",

booktitle = "Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings",

note = "7th International Conference on Cryptology and Network Security, CANS 2008 ; Conference date: 02-12-2008 Through 04-12-2008",

}

TY - GEN

T1 - Skew frobenius map and efficient scalar multiplication for pairing-based cryptography

AU - Sakemi, Yumi

AU - Nogami, Yasuyuki

AU - Okeya, Katsuyuki

AU - Kato, Hidehiro

AU - Morikawa, Yoshitaka

PY - 2008

Y1 - 2008

N2 - This paper considers a new skew Frobenius endomorphism with pairing-friendly elliptic curve defined over prime field . Then, using the new skew Frobenius map, an efficient scalar multiplication method for pairing-friendly elliptic curve is shown. According to the simulation result, a scalar multiplication by the proposed method with multi-exponentiation technique is about 40% faster than that by plain binary method.

AB - This paper considers a new skew Frobenius endomorphism with pairing-friendly elliptic curve defined over prime field . Then, using the new skew Frobenius map, an efficient scalar multiplication method for pairing-friendly elliptic curve is shown. According to the simulation result, a scalar multiplication by the proposed method with multi-exponentiation technique is about 40% faster than that by plain binary method.

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

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

U2 - 10.1007/978-3-540-89641-8_16

DO - 10.1007/978-3-540-89641-8_16

M3 - Conference contribution

AN - SCOPUS:58649117130

SN - 3540896406

SN - 9783540896401

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

SP - 226

EP - 239

BT - Cryptology and Network Security - 7th International Conference, CANS 2008, Proceedings

T2 - 7th International Conference on Cryptology and Network Security, CANS 2008

Y2 - 2 December 2008 through 4 December 2008

ER -

Skew frobenius map and efficient scalar multiplication for pairing-based cryptography

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this