Abstract
Many implementations of pairings on embedded devices such as mobile phones, sensor nodes, and smart cards have been developed. However, pairings at the security level equivalent to 128-bit AES key have not been implemented in mobile phones without a high-level OS such as Windows. The R-ate pairing is one of the fastest pairings over large prime fields. In this study, we implemented the R-ate pairing at the security level equivalent to 128-bit AES key on BREW mobile phones. We compared the processing time of the R-ate pairing with those of the Ate pairing and η T pairing. In the results, the R-ate pairing was fastest pairing. Also, we compared the processing time of pairings with those of RSA and ECC on ARM9 225MHz. In the result, the processing time of the R-ate pairing was similar those of RSA and ECC.
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
Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for Key Management - Part 1: General. NIST Special Pablication 800-57 part 1 (2005)
Barreto, P., Galbraith, S., Ó’hÉigeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designs, Codes and Cryptography 42(3), 239–271 (2007)
Barreto, P., 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)
Devegili, A., Ó’hÉigeartaigh, C., Scott, M., Dahab, R.: Multiplication and Squaring on Pairing-Friendly Fields. Cryptography ePrint Archive, Report 2006/471 (2006)
Devegili, A., 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)
Hankerson, D., Menezes, A., Scott, M.: Software Implementation of Pairings. In: Identity-Based Cryptography, pp. 188–206. IOS Press, Amsterdam (2009)
Hess, F., Smart, N., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transactions on Information Theory 52(10), 4595–4602 (2006)
Ishiguro, T., Shirase, M., Takagi, S.T.: Efficient Implementation of the Pairing on ATmega128L. IPSJ Journal 49(11), 3743–3753 (2008)
Kawahara, Y., Takagi, S.T., Okamoto, E.: Efficient Implementation of Tate Pairing on Mobile Phones using Java. IPSJ Journal 49(1), 427–435 (2008)
Koblitz, N., Menezes, A.: Pairing-Based Cryptography at High Security Levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13–36. Springer, Heidelberg (2005)
Lee, E., Lee, H.-S., Park, C.-M.: Efficient and Generalized Pairing Computation on Abelian Varieties. IEEE Transactions on Information Theory 55(4), 1793–1803 (2009)
Menezes, A.J., Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Miyazaki, Y., Shirase, M., Takagi, S.T.: Elliptic Curve/Pairing-based Cryptographies on MICAz With Some Security Levels. In: WISA 2009, Short Presentation Track, pp. 183–195 (2009)
Oliveira, L., Scott, M., Lopez, J., Dahab, R.: TinyPBC: Pairings for Authenticated Identity-Based Non-Interactive Key Distribution in Sensor Networks. In: INSS 2008, pp. 173–180 (17-19, 2008)
Scott, M., Benger, N., Charlemagne, M.: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 78–88. Springer, Heidelberg (2009)
Scott, M., Costigan, N., Abdulwahab, W.: Implementing Cryptographic Pairings on Smartcards. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 2523, pp. 159–174. Springer, Heidelberg (2003)
Shirase, M., Kawahara, Y., Takagi, S.T., Okamoto, E.: Universal η t Pairing Algorithm over Arbitrary Extension Degree. In: Kim, S., Yung, M., Lee, H.-W. (eds.) WISA 2007. LNCS, vol. 4867, pp. 1–15. Springer, Heidelberg (2008)
Standards for Efficient Cryptography Group (SECG), SEC 2: Recommended Elliptic Curve Domain Parameter, Ver. 2.0 (2010), http://www.secg.org/
Szczechowiak, P., Oliveira, L., Scott, M., Collier, M., Dahab, R.: NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks. In: Verdone, R. (ed.) EWSN 2008. LNCS, vol. 4249, pp. 134–147. Springer, Heidelberg (2006)
Yoshitomi, M., Takagi, S.T., Kiyomoto, S., Tanaka, T.: Efficient Implementation of the Pairing on Mobilephones using BREW. IEICE Transaction E91-D(5), 1330–1337 (2008)
Yoshitomi, M., Kiyomoto, S., Fukushima, K., Tanaka, T., Takagi, S.T.: Implementation of the Pairings on the Ordinary Elliptic Curves using BREW Mobilephones. In: Symposium on Cryptography and Information Security, SCIS 2009, 3C2-2 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iyama, T., Kiyomoto, S., Fukushima, K., Tanaka, T., Takagi, T. (2010). Efficient Implementation of Pairing on BREW Mobile Phones. In: Echizen, I., Kunihiro, N., Sasaki, R. (eds) Advances in Information and Computer Security. IWSEC 2010. Lecture Notes in Computer Science, vol 6434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16825-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-16825-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16824-6
Online ISBN: 978-3-642-16825-3
eBook Packages: Computer ScienceComputer Science (R0)