有限循环群中乘法阶和本原根的计算

2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-08-01 DOI:10.1109/IC3.2014.6897161

S. Dwivedi

{"title":"有限循环群中乘法阶和本原根的计算","authors":"S. Dwivedi","doi":"10.1109/IC3.2014.6897161","DOIUrl":null,"url":null,"abstract":"Multiplicative order of an element a of Group g is the least positive integer n such that an = e, where e is the identity element of G. If the order of an element is equal to |G|, it is called generator or primitive root. This paper describes the algorithms for computing multiplicative order and primitive root in ℤp*, we also present a logarithmic improvement over classical algorithms.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computing multiplicative order and primitive root in finite cyclic group\",\"authors\":\"S. Dwivedi\",\"doi\":\"10.1109/IC3.2014.6897161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiplicative order of an element a of Group g is the least positive integer n such that an = e, where e is the identity element of G. If the order of an element is equal to |G|, it is called generator or primitive root. This paper describes the algorithms for computing multiplicative order and primitive root in ℤp*, we also present a logarithmic improvement over classical algorithms.\",\"PeriodicalId\":444918,\"journal\":{\"name\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2014.6897161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2014.6897161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

群g中元素a的乘法阶是使an = e的最小正整数n，其中e是g的单位元。如果元素的阶等于| g |，则称其为生成元或本原根。本文描述了计算p*中的乘次和原始根的算法，并给出了对经典算法的对数改进。

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

查看原文本刊更多论文

Computing multiplicative order and primitive root in finite cyclic group

Multiplicative order of an element a of Group g is the least positive integer n such that an = e, where e is the identity element of G. If the order of an element is equal to |G|, it is called generator or primitive root. This paper describes the algorithms for computing multiplicative order and primitive root in ℤp*, we also present a logarithmic improvement over classical algorithms.

求助全文

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

来源期刊

2014 Seventh International Conference on Contemporary Computing (IC3)

自引率

0.00%

发文量