A note on using finite non-abelian $p$-groups in the MOR cryptosystem

Simple item page
dc.creatorMahalanobis, Ayan
dc.date2007-02-16
dc.date.accessioned2026-07-07T07:47:17Z
dc.date.available2026-07-07T07:47:17Z
dc.descriptionThe MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a $p$-group, a cryptosystem was built by this author in 'A simple generalization of El-Gamal cryptosystem to non-abelian groups'. It seems reasonable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using $p$-groups? In this paper we show that the answer is no.
dc.identifierhttps://arxiv.org/abs/cs/0702095
dc.identifierhttp://arxiv.org/abs/cs/0702095
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124117
dc.subjectCryptography and Security
dc.subjectGroup Theory
dc.titleA note on using finite non-abelian $p$-groups in the MOR cryptosystem
dc.typetext

Files

Collections

arXiv