Post-quantum Commutative Encryption Algorithm
Dmitriy Nikolaevich Moldovyan, Alexander Andreevich Moldovyan, Han Ngoc Phieu, Minh Hiệu Nguyễn · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · 2019
It is considered an extended notion of the commutativity of the encryption. Using the computational difficulty of the hidden discrete logarithm problem, a new method and post-quantum probabilistic algorithm for commutative encryption are proposed. The finite non-commutative associative algebra containing a large set of the global left-sided unites is used as the algebraic carrier of the proposed method and probabilistic commutative cipher. The latter is secure to the known-plaintext attack and, therefore, efficient to implement on its base a post-quantum no-key encryption protocol. Main properties of the algebraic carrier, which are used in the commutative encryption method, are described.