Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
589 4 |
Ultima descărcare din IBN: 2023-10-16 15:29 |
Căutarea după subiecte similare conform CZU |
004.056.53+512.54 (1) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4156) |
Algebră (400) |
SM ISO690:2012 KUNEV, Vyacheslav. Extended RSA-m algorithm as a way of increase computational complexity of cryptosystems. In: Journal of Engineering Sciences, 2018, vol. 25, nr. 2, pp. 41-51. ISSN 2587-3474. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Journal of Engineering Sciences | ||||||
Volumul 25, Numărul 2 / 2018 / ISSN 2587-3474 /ISSNe 2587-3482 | ||||||
|
||||||
CZU: 004.056.53+512.54 | ||||||
Pag. 41-51 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
Applications of extended and combined formant analysis of modern number theory are considered to protect binary information from hacking and deliberate distortion in various IT systems based on a modified RSA-m cryptosystem with fast key changes and encryption algorithms with independent transformation keys with guaranteed small or medium short-term secrecy. Such an approach can serve as one of the ways to increase the computational complexity of modern information security systems, increasing their crypto resilience and making them capable of overcoming the possible crisis of modern cryptography in the post-quantum period. Outlines the results of the development of high-speed ciphers based on controlled combinations of transformations. |
||||||
Cuvinte-cheie crypto systems, RSA-m, formant analysis, expansion, fusion of algorithms - product cipher, crypto resistance, computational complexity, quantum and post quantum cryptography, modernization |
||||||
|