Paper • The following article is Open access

On implementation of an approximating k-ary GCD algorithm

and

Published under licence by IOP Publishing Ltd
, , Citation Ismail F. Amer and Mohammed H. Najajra 2020 IOP Conf. Ser.: Mater. Sci. Eng. 862 052025 DOI 10.1088/1757-899X/862/5/052025

Download Article PDF

Article metrics

151 Total downloads

Share this article

Article and author information

Author e-mails

safadi121979@yahoo.com

mnajajra@mail.ru

Author affiliations

1 Institute of Computational Mathematics and Informational Technologies, Kazan Federal University (Kazan, Russia)

2 Department of Management Information Systems, Al Istiqlal University (Jericho, Palestine)

Buy this article in print

Journal RSS
Sign up for new issue notifications
1757-899X/862/5/052025

Abstract

In our paper, we investigate some implementations of an approximating k-ary GCD algorithm (AKA) for calculating the greatest common divisor of natural numbers for given A and B. This task has a great importance in the development of parameters for cryptographic encryption methods.

A post-publication change was made to this article on 9 Jun 2020 to correct the author names.

Export citation and abstract BibTeX RIS

Previous article in issue
Next article in issue

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

10.1088/1757-899X/862/5/052025