The MOR cryptosystem and finite p-groups

dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.date.accessioned	2019-03-15T11:28:31Z
dc.date.available	2019-03-15T11:28:31Z
dc.date.issued	2015-01	en_US
dc.identifier.citation	Contemporary Mathematics, 633, 81-95.	en_US
dc.identifier.issn	0271-4132	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/2362
dc.identifier.uri	https://doi.org/10.1090/conm/633/12653	en_US
dc.description.abstract	The ElGamal cryptosystem is the most widely used public key cryptosystem. It uses the discrete logarithm problem as the cryptographic primitive. The MOR cryptosystem is a similar cryptosystem. It uses the discrete logarithm problem in the automorphism group as the cryptographic primitive. In this paper, we study the MOR cryptosystem for finite $p$-groups. The study is complete for $p^\prime$-automorphisms. For $p$-automorphisms there are some interesting open problems.	en_US
dc.language.iso	en	en_US
dc.publisher	American Mathematical Society	en_US
dc.subject	MOR cryptosystem	en_US
dc.subject	ElGamal cryptosystem	en_US
dc.subject	Automorphisms	en_US
dc.subject	Cryptosystem	en_US
dc.subject	2015	en_US
dc.title	The MOR cryptosystem and finite p-groups	en_US
dc.type	Article	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.sourcetitle	Contemporary Mathematics	en_US
dc.publication.originofpublisher	Foreign	en_US