一种提高双点乘法运算速度的新技术

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI:10.1109/PACRIM.2005.1517374

M. Khabbazian, T. Gulliver, V. Bhargava

{"title":"一种提高双点乘法运算速度的新技术","authors":"M. Khabbazian, T. Gulliver, V. Bhargava","doi":"10.1109/PACRIM.2005.1517374","DOIUrl":null,"url":null,"abstract":"Double point multiplication is a fundamental operation in elliptic curve digital signature verification. In this paper, we propose a new technique to accelerate this operation. Using the proposed technique, we show that a significant improvement in speed can be obtained at the cost of slightly increased bandwidth. We also show that multiple processors can provide substantial performance improvements.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new technique for improving the speed of double point multiplication\",\"authors\":\"M. Khabbazian, T. Gulliver, V. Bhargava\",\"doi\":\"10.1109/PACRIM.2005.1517374\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Double point multiplication is a fundamental operation in elliptic curve digital signature verification. In this paper, we propose a new technique to accelerate this operation. Using the proposed technique, we show that a significant improvement in speed can be obtained at the cost of slightly increased bandwidth. We also show that multiple processors can provide substantial performance improvements.\",\"PeriodicalId\":346880,\"journal\":{\"name\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2005.1517374\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2005.1517374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

双点乘法运算是椭圆曲线数字签名验证中的一个基本运算。在本文中，我们提出了一种新的技术来加速这一操作。使用所提出的技术，我们表明可以以稍微增加带宽为代价获得速度的显着改进。我们还展示了多处理器可以提供实质性的性能改进。

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

查看原文本刊更多论文

A new technique for improving the speed of double point multiplication

Double point multiplication is a fundamental operation in elliptic curve digital signature verification. In this paper, we propose a new technique to accelerate this operation. Using the proposed technique, we show that a significant improvement in speed can be obtained at the cost of slightly increased bandwidth. We also show that multiple processors can provide substantial performance improvements.

求助全文

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

来源期刊

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.

自引率

0.00%

发文量