On the Generator of Stable Cubical Multivariate Encryption Maps Over Boolean Rings for Protection of Large Information System

Abstract

Encryption based on Walks in Algebraic GRAphs (EWAGRA) is used for protection of authors' rights, access to electronic books or documents located at a certain knowledge base (Information Quality Assurance Support Systems of a university, digital library supporting distance education, various digital archives and etc). The method allows generating nonlinear stream ciphers, which have some similarities with a one-time pad: different keys produce distinct ciphertexts from the same plaintext. In contrast to the case of a one-time pad, the length of the key is flexible and the encryption map is a nonlinear poly- nomial map, which order is growing with the growth of the dimension n of the plaintext space. The encryption has good resistance to attacks of the adversary when he has no access to plaintext space or has a rather small number of intercepted plaintext- ciphertext pairs. It is known that encryption and decryption maps are cubical maps. So, interception of n3 + O(n) plaintext-ciphertext pairs allows conducting a plain linearization attack for finding the inverse map. We consider the idea of the modification of this encryption algorithm after sending each message without using key exchange protocols. So the new algorithm is resistant to plain linearization attacks