A simple generalization of the ElGamal cryptosystem to non-abelian groups II

2007/06/22 by Ayan Mahalanobis, Mahalanobis, Ayan
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #cs.CR #math.GR

paper · pdf · doi:10.48550/arxiv.0706.3305

arxiv created 2011/01/25 · arxiv updated 2011/01/26

Abstract

This is a study of the MOR cryptosystem using the special linear group over finite fields. The automorphism group of the special linear group is analyzed for this purpose. At our current state of knowledge, I show that the MOR cryptosystem has better security than the ElGamal cryptosystem over finite fields.

Related

• A simple generalization of El-Gamal cryptosystem to non-abelian groups
• A note on using finite non-abelian p-groups in the MOR cryptosystem
• The MOR cryptosystem and finite p-groups
• Cryptosystems Using Automorphisms of Finitely Generated Free Groups
• MOR Cryptosystem and classical Chevalley groups in odd characteristic