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...
Salvato in:
| Autori principali: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Natura: | Статья |
| Lingua: | English |
| Pubblicazione: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Soggetti: | |
| Accesso online: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|
Documenti analoghi
-
Construction of Akushsky Core Functions Without Critical Cores
di: Lutsenko, V. V., et al.
Pubblicazione: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
di: Lutsenko, V. V., et al.
Pubblicazione: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
di: Lapina, M. A., et al.
Pubblicazione: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
di: Lutsenko, V. V., et al.
Pubblicazione: (2024) -
Modeling of parallel data encryption algorithms
di: Kocherov, Y. N., et al.
Pubblicazione: (2020)