On implementation of an approximating k-ary GCD algorithm

Autor:	Mohammed H. Najajra, Ismail F. Amer
Rok vydání:	2020
Předmět:	Discrete mathematics Euclidean algorithm Mathematics
Zdroj:	IOP Conference Series: Materials Science and Engineering. 862:052025
ISSN:	1757-899X 1757-8981
DOI:	10.1088/1757-899x/862/5/052025
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::de333750ef979184cbcf7527f03e44c1 https://doi.org/10.1088/1757-899x/862/5/052025 Zobrazit plný text záznamu