Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3735Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | MAHALANOBIS, AYAN | en_US |
| dc.date.accessioned | 2019-07-23T11:33:27Z | - |
| dc.date.available | 2019-07-23T11:33:27Z | - |
| dc.date.issued | 2012-09 | en_US |
| dc.identifier.citation | Communications in Algebra, 40(9), 3583-3596. | en_US |
| dc.identifier.issn | 1532-4125 | en_US |
| dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3735 | - |
| dc.identifier.uri | https://doi.org/10.1080/00927872.2011.602998 | en_US |
| dc.description.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 this MOR cryptosystem has better security than the ElGamal cryptosystem over finite fields. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Taylor & Francis | en_US |
| dc.subject | MOR cryptosystem|ElGamal cryptosystem | en_US |
| dc.subject | Special linear group | en_US |
| dc.subject | Discrete logarithm problem | en_US |
| dc.subject | 2012 | en_US |
| dc.title | A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups II | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Dept. of Mathematics | en_US |
| dc.identifier.sourcetitle | Communications in Algebra | en_US |
| dc.publication.originofpublisher | Foreign | en_US |
| Appears in Collections: | JOURNAL ARTICLES | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.