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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conf. Series: Materials Science and Engineering
Paper Title
Journal
Date
