Bilinear Cryptography Using Groups of Nilpotency Class 2

Ayan Mahalanobis; Pralhad Shinde

Conference Proceedings

Bilinear Cryptography Using Groups of Nilpotency Class 2

Mahalanobis A
Shinde P

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10655 LNCS 127-134

DOI: 10.1007/978-3-319-71045-7_7

5Citations

11Readers

Get full text

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.

Cite

CITATION STYLE

APA

Mahalanobis, A., & Shinde, P. (2017). Bilinear Cryptography Using Groups of Nilpotency Class 2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10655 LNCS, pp. 127–134). Springer Verlag. https://doi.org/10.1007/978-3-319-71045-7_7

Bilinear Cryptography Using Groups of Nilpotency Class 2

Abstract

Cite

Register to see more suggestions