{"title":"通过流水线CSA架构快速蒙哥马利模块化乘法","authors":"K. Manochehri, S. Pourmozafari","doi":"10.1109/ICM.2004.1434229","DOIUrl":null,"url":null,"abstract":"Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several architectures for speed up its calculations. In this paper, we use carry save adder (CSA) architecture and pipeline it to increase its performance. We show that this architecture has greater performance for FPGA design than other architectures. Hence, it is appropriate for RSA processors based on FPGAs.","PeriodicalId":359193,"journal":{"name":"Proceedings. The 16th International Conference on Microelectronics, 2004. ICM 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"Fast Montgomery modular multiplication by pipelined CSA architecture\",\"authors\":\"K. Manochehri, S. Pourmozafari\",\"doi\":\"10.1109/ICM.2004.1434229\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several architectures for speed up its calculations. In this paper, we use carry save adder (CSA) architecture and pipeline it to increase its performance. We show that this architecture has greater performance for FPGA design than other architectures. Hence, it is appropriate for RSA processors based on FPGAs.\",\"PeriodicalId\":359193,\"journal\":{\"name\":\"Proceedings. The 16th International Conference on Microelectronics, 2004. ICM 2004.\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. The 16th International Conference on Microelectronics, 2004. ICM 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICM.2004.1434229\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. The 16th International Conference on Microelectronics, 2004. ICM 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICM.2004.1434229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast Montgomery modular multiplication by pipelined CSA architecture
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several architectures for speed up its calculations. In this paper, we use carry save adder (CSA) architecture and pipeline it to increase its performance. We show that this architecture has greater performance for FPGA design than other architectures. Hence, it is appropriate for RSA processors based on FPGAs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
