2000 character limit reached
Bilinear cryptography using finite $p$-groups of nilpotency class 2
Published 21 Nov 2017 in cs.CR, cs.IT, math.GR, and math.IT | (1711.07647v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.