This article describes the method of end-to-end encryption of messages in messaging apps using the automata theory, which are necessary for the visual representation of this mechanism. Interpretation of end-to-end encryption on event non-deterministic automaton allows to implement these methods not only by software, but also by hardware. Since at the present time there is a high probability of loss and falsification of personal data of users and storing the correspondence in a decrypted form on the network, such software methods of message encryption as symmetric and asymmetrical are used now; the distinctive features of each of which were described in this article. On the basis of these encryption methods, two protocols, which are the most reliable and frequently used in modern messaging apps, were considered. In one of the methods, a serious vulnerability was found. It is missing in another protocol due to the use of Double Ratchet and triple Diffie-Hellman. This vulnerability was described in this article. In the analysis of the protocols, the Diffie-Hellman algorithm and the AES-256 standard were detailed. The AES-256 standard is represented by a form of mathematical model using the automata theory, on the basis of which a hardware implementation of the encryption mechanism is possible.
Общество с ограниченной ответственностью "Офорт" (Самара)
В данной статье рассмотрена проблема кросс серверного поиска. Предложен вариант решения при помощи специализированной поисковой системы elasticsearch. Описаны принципы работы системы и основные моменты. Представлены основные варианты кросс серверного поиска (Tribe node и Cross Cluster Search).