基于连分式展开的模乘除算法

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2013-03-14 DOI:10.1109/ARITH.2015.21

Mourad Gouicem

{"title":"基于连分式展开的模乘除算法","authors":"Mourad Gouicem","doi":"10.1109/ARITH.2015.21","DOIUrl":null,"url":null,"abstract":"In this paper, we provide new methods to generate a class of algorithms computing modular multiplication and division. All these algorithms rely on sequences derived from the Euclidean algorithm for a well chosen input. We then use these sequences as number scales of the Ostrowski number system to construct the result of either the modular multiplication or division.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"1 1","pages":"137-143"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modular Multiplication and Division Algorithms Based on Continued Fraction Expansion\",\"authors\":\"Mourad Gouicem\",\"doi\":\"10.1109/ARITH.2015.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we provide new methods to generate a class of algorithms computing modular multiplication and division. All these algorithms rely on sequences derived from the Euclidean algorithm for a well chosen input. We then use these sequences as number scales of the Ostrowski number system to construct the result of either the modular multiplication or division.\",\"PeriodicalId\":6526,\"journal\":{\"name\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"volume\":\"1 1\",\"pages\":\"137-143\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.2015.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 22nd Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.2015.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提供了新的方法来生成一类计算模乘法和模除法的算法。所有这些算法都依赖于由欧几里得算法导出的序列，以获得一个精心选择的输入。然后我们用这些数列作为Ostrowski数系统的数尺度来构造模乘法或模除法的结果。

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

查看原文本刊更多论文

Modular Multiplication and Division Algorithms Based on Continued Fraction Expansion

In this paper, we provide new methods to generate a class of algorithms computing modular multiplication and division. All these algorithms rely on sequences derived from the Euclidean algorithm for a well chosen input. We then use these sequences as number scales of the Ostrowski number system to construct the result of either the modular multiplication or division.

求助全文

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

来源期刊

2015 IEEE 22nd Symposium on Computer Arithmetic

自引率

0.00%

发文量