Extended RSA-m algorithm as a way of increase computational complexity of cryptosystems

Abstract

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 highspeed ciphers based on controlled combinations of transformations.