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...
Saved in:
| Main Authors: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Format: | Статья |
| Language: | English |
| Published: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Subjects: | |
| Online Access: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Construction of Akushsky Core Functions Without Critical Cores
by: Lutsenko, V. V., et al.
Published: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
by: Lutsenko, V. V., et al.
Published: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
by: Lapina, M. A., et al.
Published: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
by: Lutsenko, V. V., et al.
Published: (2024) -
Modeling of parallel data encryption algorithms
by: Kocherov, Y. N., et al.
Published: (2020)