基于FPGA的Montgomery模乘法器的Karatsuba算法优化设计

A. T, S. S., R. A., Santhosh K M
{"title":"基于FPGA的Montgomery模乘法器的Karatsuba算法优化设计","authors":"A. T, S. S., R. A., Santhosh K M","doi":"10.1109/ICEARS56392.2023.10085256","DOIUrl":null,"url":null,"abstract":"Better area and delay performance is the goal of the modulo multiplier architecture that has been created in this paper. The design's architecture increases both the maximum frequency and the area that is occupied on the intended FPGA. Lightweight elliptic curve encryption is constructed using the suggested architecture as a modular multiplier over general G(p). In this design, radix-2 Montgomery Modular Multiplication structure is enhanced. In order to decrease the critical route latency and raise the maximum frequency, the suggested architecture does not perform subtraction or multiplication operations, instead it performs only one pre-calculated addition operation, which reduces the loops of process in computing. When compared to other state-of-the-art modular multipliers, these multipliers' accuracy is equivalent with better area and delay.","PeriodicalId":338611,"journal":{"name":"2023 Second International Conference on Electronics and Renewable Systems (ICEARS)","volume":"9 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FPGA –based Optimized Design of Montgomery Modular Multiplier using Karatsuba Algorithm\",\"authors\":\"A. T, S. S., R. A., Santhosh K M\",\"doi\":\"10.1109/ICEARS56392.2023.10085256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Better area and delay performance is the goal of the modulo multiplier architecture that has been created in this paper. The design's architecture increases both the maximum frequency and the area that is occupied on the intended FPGA. Lightweight elliptic curve encryption is constructed using the suggested architecture as a modular multiplier over general G(p). In this design, radix-2 Montgomery Modular Multiplication structure is enhanced. In order to decrease the critical route latency and raise the maximum frequency, the suggested architecture does not perform subtraction or multiplication operations, instead it performs only one pre-calculated addition operation, which reduces the loops of process in computing. When compared to other state-of-the-art modular multipliers, these multipliers' accuracy is equivalent with better area and delay.\",\"PeriodicalId\":338611,\"journal\":{\"name\":\"2023 Second International Conference on Electronics and Renewable Systems (ICEARS)\",\"volume\":\"9 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 Second International Conference on Electronics and Renewable Systems (ICEARS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEARS56392.2023.10085256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 Second International Conference on Electronics and Renewable Systems (ICEARS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEARS56392.2023.10085256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文所创建的模乘法器结构的目标是获得更好的面积和延迟性能。该设计的架构增加了最大频率和预期FPGA上占用的面积。轻量级椭圆曲线加密使用建议的体系结构作为一般G(p)上的模乘法器来构造。在本设计中,对基-2蒙哥马利模乘法结构进行了增强。为了减少关键路由延迟和提高最大频率,该架构不执行减法或乘法运算,而是只执行一次预先计算的加法运算,从而减少了计算过程中的循环。与其他最先进的模块化乘法器相比,这些乘法器的精度等同于更好的面积和延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FPGA –based Optimized Design of Montgomery Modular Multiplier using Karatsuba Algorithm
Better area and delay performance is the goal of the modulo multiplier architecture that has been created in this paper. The design's architecture increases both the maximum frequency and the area that is occupied on the intended FPGA. Lightweight elliptic curve encryption is constructed using the suggested architecture as a modular multiplier over general G(p). In this design, radix-2 Montgomery Modular Multiplication structure is enhanced. In order to decrease the critical route latency and raise the maximum frequency, the suggested architecture does not perform subtraction or multiplication operations, instead it performs only one pre-calculated addition operation, which reduces the loops of process in computing. When compared to other state-of-the-art modular multipliers, these multipliers' accuracy is equivalent with better area and delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信