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...
Shranjeno v:
| Главные авторы: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Format: | Статья |
| Jezik: | English |
| Izdano: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Teme: | |
| Online dostop: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Podobne knjige/članki
-
Construction of Akushsky Core Functions Without Critical Cores
od: Lutsenko, V. V., и др.
Izdano: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
od: Lutsenko, V. V., и др.
Izdano: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
od: Lapina, M. A., и др.
Izdano: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
od: Lutsenko, V. V., и др.
Izdano: (2024) -
Modeling of parallel data encryption algorithms
od: Kocherov, Y. N., и др.
Izdano: (2020)