Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system
The article is devoted to the problem of generating a cryptosystem RSA key decryption on the known open parameters - system module and the encryption key. Minimum excess modular numeral system is applied to receiving multiplicative inversion of an open key on Euler's function of the system modu...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
North-Caucasus Federal University
2022-09-01
|
| Series: | Наука. Инновации. Технологии |
| Subjects: | |
| Online Access: | https://scienceit.elpub.ru/jour/article/view/315 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849388093396746240 |
|---|---|
| author | Andrey Alekseevich Kolyada Alexander Fedorovich Chernyavsky |
| author_facet | Andrey Alekseevich Kolyada Alexander Fedorovich Chernyavsky |
| author_sort | Andrey Alekseevich Kolyada |
| collection | DOAJ |
| description | The article is devoted to the problem of generating a cryptosystem RSA key decryption on the known open parameters - system module and the encryption key. Minimum excess modular numeral system is applied to receiving multiplicative inversion of an open key on Euler's function of the system module. Its bases are the elements of the factor-spectrum base of Euler's function, as well as specially selected additional base. The realized approach allows to minimize the volume of the carried-out calculations. This is ensured thanks to achieved within the minimum excess modular coding to reduce the extremely low level of complexity of accounting ratios used for the integral characteristics of the code - interval-index characteristics. |
| format | Article |
| id | doaj-art-796f9c1abc5a459dba4457c554d62e7e |
| institution | Kabale University |
| issn | 2308-4758 |
| language | Russian |
| publishDate | 2022-09-01 |
| publisher | North-Caucasus Federal University |
| record_format | Article |
| series | Наука. Инновации. Технологии |
| spelling | doaj-art-796f9c1abc5a459dba4457c554d62e7e2025-08-20T03:42:25ZrusNorth-Caucasus Federal UniversityНаука. Инновации. Технологии2308-47582022-09-01033144314Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number systemAndrey Alekseevich Kolyada0Alexander Fedorovich Chernyavsky1Belarusian State UniversityBelarusian State UniversityThe article is devoted to the problem of generating a cryptosystem RSA key decryption on the known open parameters - system module and the encryption key. Minimum excess modular numeral system is applied to receiving multiplicative inversion of an open key on Euler's function of the system module. Its bases are the elements of the factor-spectrum base of Euler's function, as well as specially selected additional base. The realized approach allows to minimize the volume of the carried-out calculations. This is ensured thanks to achieved within the minimum excess modular coding to reduce the extremely low level of complexity of accounting ratios used for the integral characteristics of the code - interval-index characteristics.https://scienceit.elpub.ru/jour/article/view/315схема rsaумножение монтгомеривозведение в степень по модулюкриптографическое rsa-преобразованиеденор-мирующий коэффициентмодулярная система счислениямодулярный кодинтервальный индексrsa schememontgomery multiplicationmodular exponentiationrsa-cryptographic transformationdenormalizing factormodular number systemmodular codeinterval index |
| spellingShingle | Andrey Alekseevich Kolyada Alexander Fedorovich Chernyavsky Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system Наука. Инновации. Технологии схема rsa умножение монтгомери возведение в степень по модулю криптографическое rsa-преобразование денор-мирующий коэффициент модулярная система счисления модулярный код интервальный индекс rsa scheme montgomery multiplication modular exponentiation rsa-cryptographic transformation denormalizing factor modular number system modular code interval index |
| title | Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system |
| title_full | Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system |
| title_fullStr | Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system |
| title_full_unstemmed | Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system |
| title_short | Generation of decryption key for the RSA cryptosystem using the minimum redundant modular number system |
| title_sort | generation of decryption key for the rsa cryptosystem using the minimum redundant modular number system |
| topic | схема rsa умножение монтгомери возведение в степень по модулю криптографическое rsa-преобразование денор-мирующий коэффициент модулярная система счисления модулярный код интервальный индекс rsa scheme montgomery multiplication modular exponentiation rsa-cryptographic transformation denormalizing factor modular number system modular code interval index |
| url | https://scienceit.elpub.ru/jour/article/view/315 |
| work_keys_str_mv | AT andreyalekseevichkolyada generationofdecryptionkeyforthersacryptosystemusingtheminimumredundantmodularnumbersystem AT alexanderfedorovichchernyavsky generationofdecryptionkeyforthersacryptosystemusingtheminimumredundantmodularnumbersystem |