{"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}
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%.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
