Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4297
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | MAHALANOBIS, AYAN | en_US |
dc.contributor.author | SHINDE, PRALHAD | en_US |
dc.date.accessioned | 2019-12-24T12:20:26Z | |
dc.date.available | 2019-12-24T12:20:26Z | |
dc.date.issued | 2017 | en_US |
dc.identifier.citation | IMACC 2017 Cryptography and Coding, 127-134. | en_US |
dc.identifier.issn | 978-3-319-71044-0 | en_US |
dc.identifier.issn | 978-3-319-71045-7 | en_US |
dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4297 | - |
dc.description.abstract | In this paper, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a group of nilpotency class 2. We discuss an example at the end. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.subject | Bilinear Cryptography | en_US |
dc.subject | Nilpotency Class 2 | en_US |
dc.subject | Discrete logarithm | en_US |
dc.subject | NBHM | en_US |
dc.subject | SERB research grant | en_US |
dc.subject | 2017 | en_US |
dc.title | Bilinear Cryptography Using Groups of Nilpotency Class 2 | en_US |
dc.type | Book chapter | en_US |
dc.contributor.department | Dept. of Mathematics | en_US |
dc.identifier.doi | https://doi.org/10.1007/978-3-319-71045-7_7 | en_US |
dc.publication.originofpublisher | Foreign | en_US |
Appears in Collections: | BOOK CHAPTERS |
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.