改进pocklington和padrÓ-sÁez立方根算法

IF 0.6 4区数学 Q3 MATHEMATICS

Bulletin of the Korean Mathematical Society Pub Date : 2019-01-01 DOI:10.4134/BKMS.B160769

Gook Hwa Cho, Hyang-Sook Lee

{"title":"改进pocklington和padrÓ-sÁez立方根算法","authors":"Gook Hwa Cho, Hyang-Sook Lee","doi":"10.4134/BKMS.B160769","DOIUrl":null,"url":null,"abstract":"In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and Padró-Sáez algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and Padró-Sáez algorithm by using a smaller base for exponentiation. Our method can reduce the average number of Fq multiplications.","PeriodicalId":55301,"journal":{"name":"Bulletin of the Korean Mathematical Society","volume":"7 1","pages":"277-283"},"PeriodicalIF":0.6000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM\",\"authors\":\"Gook Hwa Cho, Hyang-Sook Lee\",\"doi\":\"10.4134/BKMS.B160769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and Padró-Sáez algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and Padró-Sáez algorithm by using a smaller base for exponentiation. Our method can reduce the average number of Fq multiplications.\",\"PeriodicalId\":55301,\"journal\":{\"name\":\"Bulletin of the Korean Mathematical Society\",\"volume\":\"7 1\",\"pages\":\"277-283\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the Korean Mathematical Society\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.4134/BKMS.B160769\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Korean Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4134/BKMS.B160769","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了一个使用递归关系的立方根算法。此外，我们比较了Pocklington和Padró-Sáez算法与Adleman-Manders-Miller算法的实现。利用递归关系，我们改进了Pocklington和Padró-Sáez算法，使用更小的底数求幂。我们的方法可以减少Fq乘法的平均次数。

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

查看原文本刊更多论文

IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM

In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and Padró-Sáez algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and Padró-Sáez algorithm by using a smaller base for exponentiation. Our method can reduce the average number of Fq multiplications.

求助全文

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

来源期刊

Bulletin of the Korean Mathematical Society 数学-数学

CiteScore

0.80

自引率

20.00%

发文量

审稿时长

6 months

期刊介绍： This journal endeavors to publish significant research of broad interests in pure and applied mathematics. One volume is published each year, and each volume consists of six issues (January, March, May, July, September, November).