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., Безуглова, Е. С. |
|---|---|
| Format: | Статья |
| Sprog: | English |
| Udgivet: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Fag: | |
| Online adgang: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
Lignende værker
-
Construction of Akushsky Core Functions Without Critical Cores
af: Lutsenko, V. V., и др.
Udgivet: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
af: Lutsenko, V. V., и др.
Udgivet: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
af: Lapina, M. A., и др.
Udgivet: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
af: Lutsenko, V. V., и др.
Udgivet: (2024) -
Modeling of parallel data encryption algorithms
af: Kocherov, Y. N., и др.
Udgivet: (2020)