Efficient Algorithms for Pairing-Based Cryptosystems
Efficient Algorithms for Pairing-Based Cryptosystems
复制标题
DOI：
10.1007/3-540-45708-9_23
复制
发表时间：
2002-08
期刊：
影响因子：
--
通讯作者：
Paulo L. Barreto;H. Y. Kim;Ben Lynn;M. Scott
中科院分区：
文献类型：
--
作者：
Paulo L. Barreto;H. Y. Kim;Ben Lynn;M. Scott
我们描述了实现基于Tate配对的最新密码体制的快速新算法。特别是，与已知的特征3中的方法相比，我们的方法将配对计算速度提高了约55倍，并且在更大的特征中获得了与RSA相当的性能。我们还提出了更快的特征3中的标量乘法和基于FPM的平方根提取算法，后者在基于配对的密码学之外的环境中也是有用的。
We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in larger characteristics.We also propose faster algorithms for scalar multiplication in characteristic 3 and square root extraction over Fpm, the latter technique being also useful in contexts other than that of pairing-based cryptography.