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 proceedingConference contribution

17 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 languageEnglish
Title of host publicationCryptology and Network Security - 7th International Conference, CANS 2008, Proceedings
Pages226-239
Number of pages14
DOIs
Publication statusPublished - Dec 1 2008
Event7th International Conference on Cryptology and Network Security, CANS 2008 - Hong-Kong, China
Duration: Dec 2 2008Dec 4 2008

Publication series

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

Other

Other7th International Conference on Cryptology and Network Security, CANS 2008
CountryChina
CityHong-Kong
Period12/2/0812/4/08

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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