Tate配对的快速并行计算

2011 Third International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2011-11-30 DOI:10.1109/INCoS.2011.93

Zhitu Su, Chun-hui Sun, Hui Li, Jianfeng Ma, K. Fan

{"title":"Tate配对的快速并行计算","authors":"Zhitu Su, Chun-hui Sun, Hui Li, Jianfeng Ma, K. Fan","doi":"10.1109/INCoS.2011.93","DOIUrl":null,"url":null,"abstract":"In pairing-based cryptography, Miller's algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller's algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing. Our method can be applied to super singular elliptic curves and ordinary elliptic curves which are suitable for pairing-based cryptography. Compared with general version of Miller's algorithm, our method has a gain of around 50.0\\%.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast Parallel Computation of Tate Pairing\",\"authors\":\"Zhitu Su, Chun-hui Sun, Hui Li, Jianfeng Ma, K. Fan\",\"doi\":\"10.1109/INCoS.2011.93\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In pairing-based cryptography, Miller's algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller's algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing. Our method can be applied to super singular elliptic curves and ordinary elliptic curves which are suitable for pairing-based cryptography. Compared with general version of Miller's algorithm, our method has a gain of around 50.0\\\\%.\",\"PeriodicalId\":235301,\"journal\":{\"name\":\"2011 Third International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2011.93\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2011.93","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在基于配对的密码学中，米勒算法在配对计算中起着关键作用。目前，米勒算法的大多数优化都是串行结构的。本文提出了一种高效计算配对的并行方法。该方法适用于适合于基于配对密码的超奇异椭圆曲线和普通椭圆曲线。与一般版本的米勒算法相比，我们的方法的增益在50.0%左右。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast Parallel Computation of Tate Pairing

In pairing-based cryptography, Miller's algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller's algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing. Our method can be applied to super singular elliptic curves and ordinary elliptic curves which are suitable for pairing-based cryptography. Compared with general version of Miller's algorithm, our method has a gain of around 50.0\%.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 Third International Conference on Intelligent Networking and Collaborative Systems

自引率

0.00%

发文量