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...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Μορφή: | Статья |
| Γλώσσα: | English |
| Έκδοση: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Θέματα: | |
| Διαθέσιμο Online: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
Παρόμοια τεκμήρια
-
Construction of Akushsky Core Functions Without Critical Cores
ανά: Lutsenko, V. V., κ.ά.
Έκδοση: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
ανά: Lutsenko, V. V., κ.ά.
Έκδοση: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
ανά: Lapina, M. A., κ.ά.
Έκδοση: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
ανά: Lutsenko, V. V., κ.ά.
Έκδοση: (2024) -
Modeling of parallel data encryption algorithms
ανά: Kocherov, Y. N., κ.ά.
Έκδοση: (2020)