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)