Bilinear cryptography using finite $p$-groups of nilpotency class 2
Cryptography and Security
2017-11-23 v1 Information Theory
Group Theory
math.IT
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 -group of class 2. We discuss an example at the end.
Keywords
Cite
@article{arxiv.1711.07647,
title = {Bilinear cryptography using finite $p$-groups of nilpotency class 2},
author = {Ayan Mahalanobis and Pralhad Shinde},
journal= {arXiv preprint arXiv:1711.07647},
year = {2017}
}