Efficient Implementation of the Pairing on Mobilephones Using BREW
Efficient Implementation of the Pairing on Mobilephones Using BREW
复制标题
DOI：
10.1093/ietisy/e91-d.5.1330
复制
发表时间：
2007-08
期刊：
影响因子：
--
通讯作者：
M. Yoshitomi;T. Takagi;S. Kiyomoto;Toshiaki Tanaka
中科院分区：
文献类型：
--
作者：
M. Yoshitomi;T. Takagi;S. Kiyomoto;Toshiaki Tanaka
基于配对的密码系统可以实现新颖的安全应用，例如基于 ID 的密码系统，如果没有配对，这些密码系统就无法有效构建。与其他传统的公钥密码系统相比，基于配对的密码系统的处理速度相对较慢。然而，已经提出了几种计算配对的有效算法，即 Duursma-Lee 算法及其变体 ηT 配对。在本文中，我们提出了通过某些手机进行配对的有效实现。此外，我们还将配对的处理速度与其他标准公钥密码系统（即 RSA 密码系统和椭圆曲线密码系统）的处理速度进行了比较。事实上，我们在 BREW 上的 ARM9 处理器中使用超过 397 的超奇异曲线实现的处理速度达到了 100 毫秒以下。此外，配对比其他公钥密码系统更高效，并且在 BREW 手机上也可以实现足够的配对。它已经变得足够高效，可以使用 BREW 移动电话上的配对来实现安全应用程序，例如短签名、基于 ID 的密码系统或广播加密。
Pairing based cryptosystems can accomplish novel security applications such as ID-based cryptosystems, which have not been constructed efficiently without the pairing. The processing speed of the pairing based cryptosystems is relatively slow compared with the other conventional public key cryptosystems. However, several efficient algorithms for computing the pairing have been proposed, namely Duursma-Lee algorithm and its variant ηT pairing. In this paper, we present an efficient implementation of the pairing over some mobilephones. Moreover, we compare the processing speed of the pairing with that of the other standard public key cryptosystems, i.e. RSA cryptosystem and elliptic curve cryptosystem. Indeed the processing speed of our implementation in ARM9 processors on BREW achieves under 100 milliseconds using the supersingular curve over 397. In addition, the pairing is more efficient than the other public key cryptosystems, and the pairing can be achieved enough also on BREW mobilephones. It has become efficient enough to implement security applications, such as short signature, ID-based cryptosystems or broadcast encryption, using the pairing on BREW mobilephones.