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...
Uloženo v:
| Hlavní autoři: | , , , , , , , |
|---|---|
| Médium: | Статья |
| Jazyk: | English |
| Vydáno: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Témata: | |
| On-line přístup: | https://dspace.ncfu.ru/handle/123456789/29358 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| Shrnutí: | 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 Multiplication Algorithm, its realization in the Python programming language, as well as the optimization of the realization to obtain a range of values of the results of the program execution and the time of obtaining these values at different P (P – modulus of the operation of taking the remainder). As a result of the analysis, regularities and tendencies of change of the dependencies considered in the paper were revealed. |
|---|