Abstract
This paper considers a new skew Frobenius endomorphism with pairing–friendly elliptic curve \(E(\mathbb{F}{p}{})\) defined over prime field \(\mathbb{F}{p}{}\). Then, using the new skew Frobenius map, an efficient scalar multiplication method for pairing–friendly elliptic curve \(E(\mathbb{F}{p}{})\) 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barreto, P.S.L.M., Naehrig, M.: Pairing–Friendly. Elliptic Curves of Prime Order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319–331. Springer, Heidelberg (2006)
Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Cohen, H., Frey, G.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. In: Discrete Mathematics and Its Applications. Chapman & Hall CRC, Boca Raton (2005)
Devegili, A.J., Scott, M., Dahab, R.: Implementing Cryptographic Pairings over Barreto-Naehrig Curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 197–207. Springer, Heidelberg (2007)
Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on general curves, IACR, ePrint, http://eprint.iacr.org/2008/194.pdf
Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190–200. Springer, Heidelberg (2001)
GNU MP, http://gmplib.org/
Hess, F., Smart, N., Vercauteren, F.: The Eta Pairing Revisited. IEEE Trans. Information Theory, 4595–4602 (2006)
Iijima, T., Matsuo, K., Chao, J., Tsuji, S.: Construction of Frobenius maps of twists elliptic curves and its application to elliptic scalar multiplication. In: Proc. of SCIS 2002, IEICE, Japan, pp. 699–702 (2002), http://lab.iisec.ac.jp/~matsuo_lab/pub/pdf/10b-3_1263.pdf
Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised Versions of the Ate and Twisted Ate Pairings. In: Galbraith, S. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp. 302–312. Springer, Heidelberg (2007)
Nakanishi, T., Funabiki, N.: Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 533–548. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakemi, Y., Nogami, Y., Okeya, K., Kato, H., Morikawa, Y. (2008). Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds) Cryptology and Network Security. CANS 2008. Lecture Notes in Computer Science, vol 5339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89641-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-89641-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89640-1
Online ISBN: 978-3-540-89641-8
eBook Packages: Computer ScienceComputer Science (R0)