コンテンツを見る

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...

詳細記述

保存先:
書誌詳細
主要な著者: Lapina, M. A., Лапина, М. А., Borodulin, I. V., Бородулин, И. В., Koronskiy, A., Коронский, А., Martemyanov, M. V., Мартемьянов, М. В.
フォーマット: Статья
言語:English
出版事項: Springer Science and Business Media Deutschland GmbH 2024
主題:
オンライン・アクセス:https://dspace.ncfu.ru/handle/123456789/29358
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
その他の書誌記述
要約: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.