Efficient implementation of pairing on BREW mobile phones

7Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Iyama, T., Kiyomoto, S., Fukushima, K., Tanaka, T., & Takagi, T. (2010). Efficient implementation of pairing on BREW mobile phones. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6434 LNCS, pp. 326–336). Springer Verlag. https://doi.org/10.1007/978-3-642-16825-3_22

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