Research and Modification of Montgomery Multiplication Algorithm
The article the discusses the realization of Montgomery Multiplication Algorithm, and the research and analysis of the values of program runtime divided by value P and program runtime from value N. Special attention was paid to the mathematical aspects of the execution of the Montgomery Multiplicati...
Sparad:
| Huvudupphovsmän: | Lapina, M. A., Лапина, М. А., Borodulin, I. V., Бородулин, И. В., Koronskiy, A., Коронский, А., Martemyanov, M. V., Мартемьянов, М. В. |
|---|---|
| Materialtyp: | Статья |
| Språk: | English |
| Publicerad: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Ämnen: | |
| Länkar: | https://dspace.ncfu.ru/handle/123456789/29358 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
Liknande verk
-
An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
av: Lutsenko, V. V., et al.
Publicerad: (2024) -
Toward Understanding Uncertainty in Fog-Cloud Computing for Big Data Storage and Processing
av: Kucherov, N. N., et al.
Publicerad: (2024) -
On the Way to Building Reliable and Secure Cloud-Based Data Processing Systems
av: Kucherov, N. N., et al.
Publicerad: (2024) -
An Approach to Reducing Device Uncertainty in Fog-Cloud Computing
av: Kucherov, N. N., et al.
Publicerad: (2024) -
Comparative Analysis of Fast Matrix Multiplication Methods on Different Datatypes
av: Abdulsalyamova, A. S., et al.
Publicerad: (2024)