Kazan Federal University Digital Repository

Browsing Публикации сотрудников КФУ Scopus by Author "Ishmukhametov S.T."

Browsing Публикации сотрудников КФУ Scopus by Author "Ishmukhametov S.T."

Sort by: Order: Results:

  • An Effective Programming of GCD Algorithms for Natural Numbers 
    Al Halidi A.M.; Ishmukhametov S.T. (2020)
    © 2020, Allerton Press, Inc. We study the problem of acceleration of GCD algorithms for natural numbers based on the approximating k-ary algorithm. We suggest a new scheme of the approximating algorithm implementation ...
  • Comparing different GCD algorithms 
    Amer I.F.; Alkhalidi A.M.; Ishmukhametov S.T. (2020)
    © 2020 SERSC. In our paper we analyze effectiveness of several algorithms of the GCD calculation for pairs of large naturals with respect to their speed, number of iterations and possibility of parallelization of the ...
  • Investigation of the k-ary GCD Algorithm for Natural Numbers 
    Amer I.F.; Ishmukhametov S.T. (2020)
    © 2020 IEEE. In our paper we investigate the k-ary Algorithm for finding GCD of long natural numbers. We suggest an effective modification for the Algorithm which gives an essential acceleration for the whole procedure of ...
  • On the number of witnesses in the miller-rabin primality test 
    Ishmukhametov S.T.; Mubarakov B.G.; Rubtsova R.G. (2020)
    © 2020 by the authors. In this paper, we investigate the popular Miller-Rabin primality test and study its effectiveness. The ability of the test to determine prime integers is based on the difference of the number of ...
  • Programming of an approximating K-ary GCD algorithm 
    Amer I.F.; Ishmukhametov S.T.; Alkhalidi A.M. (2021)
    In our paper, we consider the procedure for effective programming of an approximating k-ary GCD algorithm of natural numbers in the C++ programming language in the Visual Studio programming environment with the installed ...

Search DSpace


Advanced Search

Browse

My Account