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

TL;DR

This paper introduces a new bilinear cryptosystem based on the discrete logarithm problem in matrices derived from finite p-groups of nilpotency class 2, offering a novel approach to cryptography.

Contribution

It proposes a novel cryptographic scheme using matrices from finite p-groups of class 2, expanding the applications of bilinear cryptography.

Findings

Development of a bilinear cryptosystem based on matrix discrete logs

Illustration of the scheme with a concrete example

Potential implications for cryptographic security

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.