files/journal/2022-09-03_18-45-30-000000_586.png

Research Journal of Applied Sciences

ISSN: Online 1993-6079
ISSN: Print 1815-932x
About US
Editors
Issues
Pages
Indexed in
92
Views
1
Downloads

Evaluation of Time Complexity in Investigation of Methods of Modular Exponentiation

Aigul K. Shaikhanova, Aleksandr D. Zolotov, Eldos M. Muhametov, Mikolaj P. Karpinski and Dinara O. Kozhahmetova
Page: 66-69 | Received 21 Sep 2022, Published online: 21 Sep 2022

Download Citation
https://doi.org/10.36478/rjasci.2015.66.69

Full Text Reference XML File PDF File

Abstract

Basic concepts of evaluation of algorithm complexity such as time and space complexity were considered by its consumption of basic computer resources. Comparative investigation of operations of binary, β and sliding window method of modular exponentiation with “left-to-right” and “right-to-left” reading bits of exponent was conducted.

How to cite this article:

Aigul K. Shaikhanova, Aleksandr D. Zolotov, Eldos M. Muhametov, Mikolaj P. Karpinski and Dinara O. Kozhahmetova. Evaluation of Time Complexity in Investigation of Methods of Modular Exponentiation.
DOI: https://doi.org/10.36478/rjasci.2015.66.69
URL: https://www.makhillpublications.co/view-article/1815-932x/rjasci.2015.66.69