Hardware implementation of an additive bit-serial algorithm for the discrete logarithm modulo 2/sup k/

Lun Li, A. Fit-Florea, M. Thornton, D. Matula
{"title":"Hardware implementation of an additive bit-serial algorithm for the discrete logarithm modulo 2/sup k/","authors":"Lun Li, A. Fit-Florea, M. Thornton, D. Matula","doi":"10.1109/ISVLSI.2005.35","DOIUrl":null,"url":null,"abstract":"We describe the hardware implementation of a novel algorithm for computing the discrete logarithm modulo 2/sup k/. The circuit has a total latency of less than k table-lookup-determined shift-and-add modulo 2/sup k/ operations. We introduce a one-to-one mapping between k-bit binary integers and k-bit encodings of a factorization of the integers employing the discrete logarithm. We compare the physical layout result for the circuit when k = 8, 16, 32, and 64.","PeriodicalId":158790,"journal":{"name":"IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05)","volume":"1938 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2005.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

We describe the hardware implementation of a novel algorithm for computing the discrete logarithm modulo 2/sup k/. The circuit has a total latency of less than k table-lookup-determined shift-and-add modulo 2/sup k/ operations. We introduce a one-to-one mapping between k-bit binary integers and k-bit encodings of a factorization of the integers employing the discrete logarithm. We compare the physical layout result for the circuit when k = 8, 16, 32, and 64.
离散对数模2/sup k/的加性位串行算法的硬件实现
我们描述了一种计算离散对数模2/sup k/的新算法的硬件实现。电路的总延迟小于k次表查找决定的移位加模2/sup k/次操作。我们引入了k位二进制整数和k位编码之间的一对一映射,这些整数采用离散对数分解。我们比较了k = 8,16,32和64时电路的物理布局结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信