Zobrazeno 1 - 10
of 313
pro vyhledávání: '"Exponentiation by squaring"'
Autor:
Vladislav E. Chumakov, Olga Safaryan, Larissa V. Cherckesova, Ivan A. Smirnov, Alexandr I. Gavlicky, Denis A. Korochentsev
Publikováno v:
EWDTS
In the present paper the exponentiation algorithm “To Center and Back” based on the idea of the additive chains exponentiation method is developed. The created by authors algorithm allows to reduce the calculation time and to improve the performa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e511448d491f2868c25215c075aef187
https://doi.org/10.1109/ewdts52692.2021.9580999
https://doi.org/10.1109/ewdts52692.2021.9580999
Autor:
Robert J. Valenza
Publikováno v:
JOURNAL OF ADVANCES IN MATHEMATICS. 16:8430-8448
This paper introduces a computational scheme for calculating the exponential bw where b and w are positive integers. This two-step method is based on elementary number theory that is used routinely in this and similar contexts, especially the Chinese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e4b52c664318ac311532baefc0eae59
https://doi.org/10.24297/jam.v16i0.8301
https://doi.org/10.24297/jam.v16i0.8301
Publikováno v:
Arabian Journal for Science and Engineering. 43:903-911
Modular exponentiation is a fundamental and most time-consuming operation in several public-key cryptosystems such as the RSA cryptosystem. In this paper, we propose two new parallel algorithms. The first one is a fast parallel algorithm to multiply
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9308cd9e6eaf3133f4d776796bcc69ae
https://doi.org/10.1007/s13369-017-2797-3
https://doi.org/10.1007/s13369-017-2797-3
Publikováno v:
Applied Mathematics and Computation. 292:406-416
Modular exponentiation is a time-consuming operation widely used in cryptography. Modular multi-exponentiation, a generalization of modular exponentiation also used in cryptography, deserves further analysis from the algorithmic point of view. The pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7cbea9ad359491508af48e42f6b8170
https://doi.org/10.1016/j.amc.2016.07.036
https://doi.org/10.1016/j.amc.2016.07.036
Autor:
Irina Reshetnikova, Nikita Ye. Myzdrikov, Vasiliy I. Yukhnov, Olga Safaryan, Vitaliy M. Porksheyan, Andrey G. Lobodenko, Larissa V. Cherckesova, Ivan Ye. Semeonov
Publikováno v:
EWDTS
This article will consider the probability test of Solovey-Strassen, to determine the simplicity of the number and its possible modifications. This test allows for the shortest possible time to determine whether the number is prime or not. C# program
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0eb20ab6154d056686c1e3dfb00a288
https://doi.org/10.1109/ewdts.2019.8884469
https://doi.org/10.1109/ewdts.2019.8884469
Autor:
Sang-Un Lee
Publikováno v:
The Journal of the Institute of Internet Broadcasting and Communication. 16:41-47
The times of multiplication for encryption and decryption of cryptosystem is primarily determined by implementation efficiency of the modular exponentiation of (mod m). The most frequently used among standard modular exponentiation methods is a stand
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87323aefa990a532472af2d5811b55f1
https://doi.org/10.7236/jiibc.2016.16.2.41
https://doi.org/10.7236/jiibc.2016.16.2.41
Autor:
Ji Zhang, Xu-chuan Zhou
Publikováno v:
2018 IEEE 3rd International Conference on Big Data Analysis (ICBDA).
Matrix Fast Exponentiation Algorithm (MFEA) is widely used as an algorithm for fast solving the matrix power. But its efficiency can not meet the needs of the big data application. In this paper, we analyze the parallel potential of MFEA and propose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3fa751eba8d630cf0ab877c2eb427adb
https://doi.org/10.1109/icbda.2018.8367669
https://doi.org/10.1109/icbda.2018.8367669
Autor:
Abdalhossein Rezai, Parviz Keshavarzi
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 49:255-268
Modular exponentiation is an important operation in public-key cryptography. The Common-Multiplicand-Multiplication (CMM) modular exponentiation is an efficient exponentiation algorithm. This paper presents a novel method for speeding up the CMM modu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe7c1b96bf70a201dd700cff51de9b8a
https://doi.org/10.1051/ita/2015007
https://doi.org/10.1051/ita/2015007
Autor:
V. V. Kochergin
Publikováno v:
Journal of Applied and Industrial Mathematics. 9:68-82
We study two generalizations of the classical problem of fast exponentiation, namely: Bellman’s problem on computational complexity (the minimal number of multiplications) based only on the variables of a normalized monomial of m variables and Knut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a3094452213795550776dd217d41294
https://doi.org/10.1134/s1990478915010081
https://doi.org/10.1134/s1990478915010081
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811065194
For big data security, high-speed arithmetic units are needed. Finite field arithmetic has received much attention in error-control codes, cryptography, etc. The modular exponentiation over finite fields is an important and essential cryptographic op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7fa25108464ce2540cbbd0c0c7e68b6
https://doi.org/10.1007/978-981-10-6520-0_6
https://doi.org/10.1007/978-981-10-6520-0_6
