并行GF(2n)乘法器

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI:10.1109/ACSSC.2017.8335505

Trenton J. Grale, E. Swartzlander

{"title":"并行GF(2n)乘法器","authors":"Trenton J. Grale, E. Swartzlander","doi":"10.1109/ACSSC.2017.8335505","DOIUrl":null,"url":null,"abstract":"Operations over polynomial Galois fields GF(2n) are employed in a variety of cryptographic systems. These operations include multiplication and reduction with respect to an irreducible polynomial modulus. Fast parallel multipliers can be designed but require substantial die area. Building on prior work, two fully parallel polynomial n× n multipliers are presented with O(log2 n) latency, which use lookup tables to store modular reduction terms.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Parallel GF(2n) multipliers\",\"authors\":\"Trenton J. Grale, E. Swartzlander\",\"doi\":\"10.1109/ACSSC.2017.8335505\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Operations over polynomial Galois fields GF(2n) are employed in a variety of cryptographic systems. These operations include multiplication and reduction with respect to an irreducible polynomial modulus. Fast parallel multipliers can be designed but require substantial die area. Building on prior work, two fully parallel polynomial n× n multipliers are presented with O(log2 n) latency, which use lookup tables to store modular reduction terms.\",\"PeriodicalId\":296208,\"journal\":{\"name\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2017.8335505\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

多项式伽罗瓦域GF(2n)上的运算被应用于各种密码系统中。这些运算包括对不可约多项式模的乘法和约简。快速并行乘法器可以设计，但需要大量的模具面积。在先前工作的基础上，提出了两个完全并行的多项式nxn乘法器，其延迟为O(log2 n)，它们使用查找表来存储模块化约简项。

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

查看原文本刊更多论文

Parallel GF(2n) multipliers

Operations over polynomial Galois fields GF(2n) are employed in a variety of cryptographic systems. These operations include multiplication and reduction with respect to an irreducible polynomial modulus. Fast parallel multipliers can be designed but require substantial die area. Building on prior work, two fully parallel polynomial n× n multipliers are presented with O(log2 n) latency, which use lookup tables to store modular reduction terms.

求助全文

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

来源期刊

2017 51st Asilomar Conference on Signals, Systems, and Computers

自引率

0.00%

发文量