An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
This paper examines the practical implementation of the Montgomery algorithm in asymmetric cryptosystems using the Residue Number System. Residue Number System enables concurrent computations of additions and multiplications across multiple channels, eliminating the need for bit carrying between the...
保存先:
| 主要な著者: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| フォーマット: | Статья |
| 言語: | English |
| 出版事項: |
Springer Science and Business Media Deutschland GmbH
2024
|
| 主題: | |
| オンライン・アクセス: | https://dspace.ncfu.ru/handle/123456789/29362 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Construction of Akushsky Core Functions Without Critical Cores
著者:: Lutsenko, V. V., 等
出版事項: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
著者:: Lutsenko, V. V., 等
出版事項: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
著者:: Lapina, M. A., 等
出版事項: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
著者:: Lutsenko, V. V., 等
出版事項: (2024) -
Modeling of parallel data encryption algorithms
著者:: Kocherov, Y. N., 等
出版事項: (2020)