Study of the k-ary GCD Algorithm-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Study of the k-ary GCD Algorithm

Published:2020-10-01 Issue:1 Volume:1658 Page:012001
ISSN:1742-6588
Container-title:Journal of Physics: Conference Series
language:
Short-container-title:J. Phys.: Conf. Ser.

Author:

Amer Ismail F,Saad Muhammad

Abstract

Abstract In our paper, we consider some approaches to accelerating the calculation of the Greatest Common Divisor (GCD) of natural numbers for given A and B based on the k-ary GCD algorithm. Such a task arises in the implementation of many mathematical and number-theoretic algorithms, for example, in cryptography and number theory (see [8]).

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Link

https://iopscience.iop.org/article/10.1088/1742-6596/1658/1/012001/pdf

Reference16 articles.

1. Analysis of Schönhage-Strassen multiplication algorithm in finite Galois fields;Amer;Astra Salvensis,2017

2. On implementation of an approximating k-ary GCD algorithm;Amer;IOP Conference Series: Materials Science and Engineering,2020

3. Lenstra Factorization Method Convergence Investigation on Elliptic Curves;Amer;Research Journal of Applied Sciences,2015

4. On acceleration of the k-ary GCD algorithm;Amer;Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki,2019

5. Analysis of the k-ary Euclid for tuples of integers;Amer;Journal of Physics: Conference Series,2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP