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...
Sparad:
| Huvudupphovsmän: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Materialtyp: | Статья |
| Språk: | English |
| Publicerad: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Ämnen: | |
| Länkar: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
Liknande verk
-
Construction of Akushsky Core Functions Without Critical Cores
av: Lutsenko, V. V., et al.
Publicerad: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
av: Lutsenko, V. V., et al.
Publicerad: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
av: Lapina, M. A., et al.
Publicerad: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
av: Lutsenko, V. V., et al.
Publicerad: (2024) -
Modeling of parallel data encryption algorithms
av: Kocherov, Y. N., et al.
Publicerad: (2020)