Bilinear cryptography using finite $p$-groups of nilpotency class 2

Ayan Mahalanobis; Pralhad Shinde

arxiv: 1711.07647 · v1 · pith:SARIWVICnew · submitted 2017-11-21 · 💻 cs.CR · cs.IT· math.GR· math.IT

Bilinear cryptography using finite p-groups of nilpotency class 2

Ayan Mahalanobis , Pralhad Shinde This is my paper

classification 💻 cs.CR cs.ITmath.GRmath.IT

keywords bilinearclassfinitematricescomecryptographycryptosystemdevelop

0 comments

read the original abstract

In this short note, 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 finite $p$-group of class 2. We discuss an example at the end.

This paper has not been read by Pith yet.

Bilinear cryptography using finite p-groups of nilpotency class 2

discussion (0)