Bilinear cryptography using finite p-groups of nilpotency class 2

11/21/2017

∙

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.

READ FULL TEXT

Bilinear cryptography using finite p-groups of nilpotency class 2

Multilinear Cryptography using Nilpotent Groups

Improved method for finding optimal formulae for bilinear maps in a finite field

Further results on discrete unitary invariance

Post-Quantum Cryptography: Riemann Primitives and Chrysalis

Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era

On the Complexity of Solving Generic Over-determined Bilinear Systems

Reduced Connectivity for Local Bilinear Jacobi Sets

Bilinear cryptography using finite p-groups of nilpotency class 2

Related Research

Multilinear Cryptography using Nilpotent Groups

Improved method for finding optimal formulae for bilinear maps in a finite field

Further results on discrete unitary invariance

Post-Quantum Cryptography: Riemann Primitives and Chrysalis

Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era

On the Complexity of Solving Generic Over-determined Bilinear Systems

Reduced Connectivity for Local Bilinear Jacobi Sets