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...
Enregistré dans:
| Auteurs principaux: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Format: | Статья |
| Langue: | English |
| Publié: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Sujets: | |
| Accès en ligne: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Construction of Akushsky Core Functions Without Critical Cores
par: Lutsenko, V. V., et autres
Publié: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
par: Lutsenko, V. V., et autres
Publié: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
par: Lapina, M. A., et autres
Publié: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
par: Lutsenko, V. V., et autres
Publié: (2024) -
Modeling of parallel data encryption algorithms
par: Kocherov, Y. N., et autres
Publié: (2020)