Bilinear cryptography using finite $p$-groups of nilpotency class 2
arXiv:1711.07647v1
Originality Incremental advance
AI Analysis
This work addresses cryptographic security for applications requiring bilinear pairings, but it appears incremental as it builds on existing group-based cryptography.
The paper tackled the problem of developing a bilinear cryptosystem by using the discrete logarithm problem in matrices from finite p-groups of nilpotency class 2, resulting in a novel cryptographic approach with an example provided.
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.