Enviar artigo por via de e-mail An approximating k-ary GCD algorithm
- Autores: Ishmukhametov S.1
-
Afiliações:
- Institute of Computational Mathematics and Information Technologies
- Edição: Volume 37, Nº 6 (2016)
- Páginas: 723-729
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198413
- DOI: https://doi.org/10.1134/S1995080216060147
- ID: 198413
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
In our paper we elaborate a new version of the k-ary GCD algorithm. Our algorithm is based on the Farey Series and surpasses all existing realizations of the k-ary algorithm. It can have practical applications inMathematics and Cryptography.
Palavras-chave
Sobre autores
Sh. Ishmukhametov
Institute of Computational Mathematics and Information Technologies
Autor responsável pela correspondência
Email: ishm@nextmail.ru
Rússia, Kremlevskaya ul. 18, Kazan, Tatrstan, 420008
