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...
Na minha lista:
| Главные авторы: | Lutsenko, V. V., Луценко, В. В., Bezuglova, E. S., Безуглова, Е. С. |
|---|---|
| Formato: | Статья |
| Idioma: | English |
| Publicado em: |
Springer Science and Business Media Deutschland GmbH
2024
|
| Assuntos: | |
| Acesso em linha: | https://dspace.ncfu.ru/handle/123456789/29362 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Registos relacionados
-
Construction of Akushsky Core Functions Without Critical Cores
Por: Lutsenko, V. V., и др.
Publicado em: (2024) -
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
Por: Lutsenko, V. V., и др.
Publicado em: (2025) -
Research and Modification of Montgomery Multiplication Algorithm
Por: Lapina, M. A., и др.
Publicado em: (2024) -
Investigation of Neural Network Methods for Error Detection and Correction in the Residue Number System
Por: Lutsenko, V. V., и др.
Publicado em: (2024) -
Modeling of parallel data encryption algorithms
Por: Kocherov, Y. N., и др.
Publicado em: (2020)