首页> 外文会议>International Conference on Contemporary Computing >Computing multiplicative order and primitive root in finite cyclic group
【24h】

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.
机译:组g的元素a的乘法顺序是最小正整数n,使得an = e,其中e是G的标识元素。如果元素的顺序等于| G |,则称为生成器或原始根。本文介绍了ℤp*中用于计算乘法阶和原始根的算法,我们还提出了对经典算法的对数改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号