Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5339 LNCS 226-239
DOI: 10.1007/978-3-540-89641-8_16
20Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free