基于可编程元胞自动机的Montgomery乘法体系结构设计

The 2003 Congress on Evolutionary Computation, 2003. CEC '03. Pub Date : 2003-12-08 DOI:10.1109/CEC.2003.1299874

J. Jeon, K. Yoo

{"title":"基于可编程元胞自动机的Montgomery乘法体系结构设计","authors":"J. Jeon, K. Yoo","doi":"10.1109/CEC.2003.1299874","DOIUrl":null,"url":null,"abstract":"This study presents a Montgomery multiplication architecture using irreducible all one polynomial (AOP) in GF(2/sup m/) based on programmable cellular automata (PCA). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of irreducible AOP and PCA. The proposed architecture is possible to implement the modular exponentiation, division, inversion architectures.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Design of Montgomery multiplication architecture based on programmable cellular automata\",\"authors\":\"J. Jeon, K. Yoo\",\"doi\":\"10.1109/CEC.2003.1299874\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study presents a Montgomery multiplication architecture using irreducible all one polynomial (AOP) in GF(2/sup m/) based on programmable cellular automata (PCA). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of irreducible AOP and PCA. The proposed architecture is possible to implement the modular exponentiation, division, inversion architectures.\",\"PeriodicalId\":416243,\"journal\":{\"name\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2003.1299874\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

提出了一种基于可编程元胞自动机(PCA)的基于GF(2/sup m/)的不可约全一多项式(AOP)的Montgomery乘法体系结构。该体系结构结合了不可约AOP和PCA的特点，具有高规律性和低延迟的优点。所提出的体系结构可以实现模块化的求幂、除法、反演体系结构。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Design of Montgomery multiplication architecture based on programmable cellular automata

This study presents a Montgomery multiplication architecture using irreducible all one polynomial (AOP) in GF(2/sup m/) based on programmable cellular automata (PCA). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of irreducible AOP and PCA. The proposed architecture is possible to implement the modular exponentiation, division, inversion architectures.

求助全文

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

来源期刊

The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

自引率

0.00%

发文量