Репозиторий научных и учебно-методических публикаций
ФГАОУ ВО «Северо-Кавказский федеральный университет»
Please use this identifier to cite or link to this item:
https://dspace.ncfu.ru/handle/20.500.12258/11274| Title: | Modeling of parallel data encryption algorithms |
| Authors: | Kocherov, Y. N. Кочеров, Ю. Н. Samoylenko, D. V. Самойленко, Д. В. Tikhonov, E. E. Тихонов, Е. Е. |
| Keywords: | Information encryption;Parallel algorithms;Residue number system (RNS);RSA algorithm;Numbering systems;Cryptography |
| Issue Date: | 2019 |
| Publisher: | Institute of Electrical and Electronics Engineers Inc. |
| Citation: | Kocherov, Y.N., Samoylenko, D.V., Tikhonov, E.E. Modeling of Parallel Data Encryption Algorithms // 2019 International Multi-Conference on Industrial Engineering and Modern Technologies, FarEastCon 2019. - 2019. - Номер статьи 8934747 |
| Series/Report no.: | 2019 International Multi-Conference on Industrial Engineering and Modern Technologies, FarEastCon 2019 |
| Abstract: | The article discusses the issues of modeling parallel information encryption algorithms using the residual number system and examples of RSA encryption algorithms, recover numbers and simulate parallel encryption algorithms in Matlab Simulink.The purpose of this article is to increase cryptographic strength by parallel execution of various cryptographic algorithms or parallel use of the same algorithm, but with different keys |
| URI: | https://www.scopus.com/record/display.uri?eid=2-s2.0-85078568916&origin=resultslist&sort=plf-f&src=s&st1=Modeling+of+Parallel+Data+Encryption+Algorithms&st2=&sid=045f90b9a555e92e43a2b066b4e2fda5&sot=b&sdt=b&sl=62&s=TITLE-ABS-KEY%28Modeling+of+Parallel+Data+Encryption+Algorithms%29&relpos=0&citeCnt=0&searchTerm= http://hdl.handle.net/20.500.12258/11274 |
| Appears in Collections: | Статьи, проиндексированные в SCOPUS, WOS |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| scopusresults 1198 .pdf Restricted Access | 217.59 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.