Post-quantum Commutative Encryption Algorithm
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.
KeywordsPost-quantum cryptography Commutative probabilistic encryption No-key protocol Hidden logarithm problem Finite non-commutative algebra Associative algebra
The reported study was partially funded by Russian Foundation for Basic Research (project #18-57-54002-Viet_a) and by VietNam Academy of Science and Technology (project # QTRU01.08/18-19).
- 2.First NIST Standardization Conference, 11–13 April 2018 (2018). http://prometheuscrypt.gforge.inria.fr/2018-04-18.pqc2018.html
- 8.Hellman, M.E., Pohlig, S.C.: Exponentiation cryptographic apparatus and method. U.S. Patent # 4,424,414. (1984)Google Scholar