MOR Cryptosystem and classical Chevalley groups in odd characteristic
This work addresses cryptographic security for applications using Chevalley groups, but it appears incremental as it extends known methods to specific groups.
The paper tackled the security of the MOR cryptosystem using finite classical Chevalley groups in odd characteristic, developing an algorithm for orthogonal and symplectic groups and analyzing the hardness of the cryptosystem, though no concrete numerical results were provided.
In this paper we study the MOR cryptosystem using finite classical Chevalley groups over a finite field of odd characteristic. In the process we develop an algorithm for these Chevalley groups in the same spirit as the row-column operation for special linear group. We focus our study on orthogonal and symplectic groups. We find the hardness of the proposed MOR cryptosystem for these groups.