Cryptanalysis of MOR and Discrete Logarithms in Inner Automorphism Groups

摘要

The MOR cryptosystem was introduced in 2001 as a new public key cryptosystem based on non-abelian groups. This paper demonstrates that the complexity of breaking MOR based on groups of the form GL(n,q) × θ H (H a finite abelian group) is (with respect to polynomial reduction) not higher than the complexity of the discrete logarithm problem in small extension fields of F_q. Additionally we consider the construction of a generic attack on MOR.