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
विषय:	Akushsky core function Residue number system (RNS) Montgomery algorithm Cryptographic applications Base extension
ऑनलाइन पहुंच:	https://dspace.ncfu.ru/handle/123456789/29362
टैग :	टैग जोड़ें कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

id	ir-123456789-29362
record_format	dspace
spelling	ir-123456789-293622024-12-11T11:38:58Z An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function Lutsenko, V. V. Луценко, В. В. Bezuglova, E. S. Безуглова, Е. С. Akushsky core function Residue number system (RNS) Montgomery algorithm Cryptographic applications Base extension 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 them. Base extension is an essential aspect of RNS implementation for asymmetric cryptosystems. In this research, we introduce a novel method for conducting base expansion using the Akushsky Core Function. Our findings show that this innovative technique significantly reduces computational expenses compared to existing methods. The proposed approach enhances the efficiency of the Montgomery algorithm and advances the field of asymmetric cryptography by introducing a streamlined process for base expansion in the context of Residue Number Systems. 2024-12-11T11:37:40Z 2024-12-11T11:37:40Z 2024 Статья Lutsenko, V., Bezuglova, E. An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function // Lecture Notes in Networks and Systems. - 2024. - 1207 LNNS. - pp. 166-177. - DOI: 10.1007/978-3-031-77229-0_17 https://dspace.ncfu.ru/handle/123456789/29362 en Lecture Notes in Networks and Systems application/pdf Springer Science and Business Media Deutschland GmbH
institution	СКФУ
collection	Репозиторий
language	English
topic	Akushsky core function Residue number system (RNS) Montgomery algorithm Cryptographic applications Base extension
spellingShingle	Akushsky core function Residue number system (RNS) Montgomery algorithm Cryptographic applications Base extension Lutsenko, V. V. Луценко, В. В. Bezuglova, E. S. Безуглова, Е. С. An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
description	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 them. Base extension is an essential aspect of RNS implementation for asymmetric cryptosystems. In this research, we introduce a novel method for conducting base expansion using the Akushsky Core Function. Our findings show that this innovative technique significantly reduces computational expenses compared to existing methods. The proposed approach enhances the efficiency of the Montgomery algorithm and advances the field of asymmetric cryptography by introducing a streamlined process for base expansion in the context of Residue Number Systems.
format	Статья
author	Lutsenko, V. V. Луценко, В. В. Bezuglova, E. S. Безуглова, Е. С.
author_facet	Lutsenko, V. V. Луценко, В. В. Bezuglova, E. S. Безуглова, Е. С.
author_sort	Lutsenko, V. V.
title	An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
title_short	An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
title_full	An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
title_fullStr	An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
title_full_unstemmed	An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
title_sort	efficient implementation of the montgomery algorithm using the akushsky core function
publisher	Springer Science and Business Media Deutschland GmbH
publishDate	2024
url	https://dspace.ncfu.ru/handle/123456789/29362
work_keys_str_mv	AT lutsenkovv anefficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction AT lucenkovv anefficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction AT bezuglovaes anefficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction AT bezuglovaes anefficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction AT lutsenkovv efficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction AT lucenkovv efficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction AT bezuglovaes efficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction AT bezuglovaes efficientimplementationofthemontgomeryalgorithmusingtheakushskycorefunction
_version_	1842245444749492224

An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function

समान संसाधन