一种RNS模乘法算法

2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS) Pub Date : 2013-12-01 DOI:10.1109/ICECS.2013.6815571

D. Schinianakis, T. Stouraitis

{"title":"一种RNS模乘法算法","authors":"D. Schinianakis, T. Stouraitis","doi":"10.1109/ICECS.2013.6815571","DOIUrl":null,"url":null,"abstract":"An RNS implementation of Barrett's modular multiplication algorithm is presented in this paper. Existing algorithms for RNS modular multiplication employ Montgomery's technique. An algorithmic comparison with such state-of-the-art solutions shows that the proposed algorithm may reduce the total number of modular multiplications per RNS modular multiplication by 33%-50%.","PeriodicalId":117453,"journal":{"name":"2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An RNS modular multiplication algorithm\",\"authors\":\"D. Schinianakis, T. Stouraitis\",\"doi\":\"10.1109/ICECS.2013.6815571\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An RNS implementation of Barrett's modular multiplication algorithm is presented in this paper. Existing algorithms for RNS modular multiplication employ Montgomery's technique. An algorithmic comparison with such state-of-the-art solutions shows that the proposed algorithm may reduce the total number of modular multiplications per RNS modular multiplication by 33%-50%.\",\"PeriodicalId\":117453,\"journal\":{\"name\":\"2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS)\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECS.2013.6815571\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECS.2013.6815571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

本文提出了Barrett模乘法算法的RNS实现。现有的RNS模乘法算法采用了Montgomery的技术。与这些最先进的解决方案的算法比较表明，所提出的算法可以将每个RNS模块乘法的模块乘法总数减少33%-50%。

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

查看原文本刊更多论文

An RNS modular multiplication algorithm

An RNS implementation of Barrett's modular multiplication algorithm is presented in this paper. Existing algorithms for RNS modular multiplication employ Montgomery's technique. An algorithmic comparison with such state-of-the-art solutions shows that the proposed algorithm may reduce the total number of modular multiplications per RNS modular multiplication by 33%-50%.

求助全文

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

来源期刊

2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS)

自引率

0.00%

发文量