改进的统一可伸缩基数-2蒙哥马利乘法器

17th IEEE Symposium on Computer Arithmetic (ARITH'05) Pub Date : 2005-06-27 DOI:10.1109/ARITH.2005.9

D. Harris, R. Krishnamurthy, M. Anders, S. Mathew, S. Hsu

{"title":"改进的统一可伸缩基数-2蒙哥马利乘法器","authors":"D. Harris, R. Krishnamurthy, M. Anders, S. Mathew, S. Hsu","doi":"10.1109/ARITH.2005.9","DOIUrl":null,"url":null,"abstract":"This paper describes an improved version of the Tenca-Koc unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half the queue memory requirement. Like the Tenca-Koc multiplier, this design is reconfigurable to accept any input precision in either GF(p) or GF(2/sup n/) up to the size of the on-chip memory. An FPGA implementation can perform 1024-bit modular exponentiation in 16 ms using 5598 4-input lookup tables, making it the fastest unified scalable design yet reported.","PeriodicalId":194902,"journal":{"name":"17th IEEE Symposium on Computer Arithmetic (ARITH'05)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"107","resultStr":"{\"title\":\"An improved unified scalable radix-2 Montgomery multiplier\",\"authors\":\"D. Harris, R. Krishnamurthy, M. Anders, S. Mathew, S. Hsu\",\"doi\":\"10.1109/ARITH.2005.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes an improved version of the Tenca-Koc unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half the queue memory requirement. Like the Tenca-Koc multiplier, this design is reconfigurable to accept any input precision in either GF(p) or GF(2/sup n/) up to the size of the on-chip memory. An FPGA implementation can perform 1024-bit modular exponentiation in 16 ms using 5598 4-input lookup tables, making it the fastest unified scalable design yet reported.\",\"PeriodicalId\":194902,\"journal\":{\"name\":\"17th IEEE Symposium on Computer Arithmetic (ARITH'05)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"107\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th IEEE Symposium on Computer Arithmetic (ARITH'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.2005.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th IEEE Symposium on Computer Arithmetic (ARITH'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.2005.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 107

摘要

本文描述了Tenca-Koc统一可伸缩的基数-2蒙哥马利乘法器的改进版本，它将小精度和中等精度操作数的延迟降低了一半，并将队列内存需求降低了一半。与Tenca-Koc乘法器一样，该设计可重新配置，以接受GF(p)或GF(2/sup n/)的任何输入精度，直至片上存储器的大小。FPGA实现可以使用5598个4输入查找表在16毫秒内执行1024位模块化幂运算，使其成为迄今为止报道的最快的统一可扩展设计。

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

查看原文本刊更多论文

An improved unified scalable radix-2 Montgomery multiplier

This paper describes an improved version of the Tenca-Koc unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half the queue memory requirement. Like the Tenca-Koc multiplier, this design is reconfigurable to accept any input precision in either GF(p) or GF(2/sup n/) up to the size of the on-chip memory. An FPGA implementation can perform 1024-bit modular exponentiation in 16 ms using 5598 4-input lookup tables, making it the fastest unified scalable design yet reported.

求助全文

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

来源期刊

17th IEEE Symposium on Computer Arithmetic (ARITH'05)

自引率

0.00%

发文量