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...
Guardat en:
| Autors principals: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Format: | Статья |
| Idioma: | English |
| Publicat: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Matèries: | |
| Accés en línia: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Ítems similars
-
Construction of Akushsky Core Functions Without Critical Cores
per: Lutsenko, V. V., et al.
Publicat: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
per: Lutsenko, V. V., et al.
Publicat: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
per: Lapina, M. A., et al.
Publicat: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
per: Lutsenko, V. V., et al.
Publicat: (2024) -
Modeling of parallel data encryption algorithms
per: Kocherov, Y. N., et al.
Publicat: (2020)