Research Article
Post-quantum Commutative Encryption Algorithm
120 downloads
@INPROCEEDINGS{10.1007/978-3-030-34365-1_16, author={Dmitriy Moldovyan and Alexandr Moldovyan and Han Phieu and Minh Nguyen}, title={Post-quantum Commutative Encryption Algorithm}, proceedings={Context-Aware Systems and Applications, and Nature of Computation and Communication. 8th EAI International Conference, ICCASA 2019, and 5th EAI International Conference, ICTCC 2019, My Tho City, Vietnam, November 28-29, 2019, Proceedings}, proceedings_a={ICCASA \& ICTCC}, year={2019}, month={12}, keywords={Post-quantum cryptography Commutative probabilistic encryption No-key protocol Hidden logarithm problem Finite non-commutative algebra Associative algebra}, doi={10.1007/978-3-030-34365-1_16} }- Dmitriy Moldovyan
Alexandr Moldovyan
Han Phieu
Minh Nguyen
Year: 2019
Post-quantum Commutative Encryption Algorithm
ICCASA & ICTCC
Springer
DOI: 10.1007/978-3-030-34365-1_16
Abstract
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.
Copyright © 2019–2024 ICST