Bilinear cryptography using groups of nilpotency class 2

DOI10.1007/978-3-319-71045-7_7MaRDI QIDQ1744849zbMATH OpenOpenAlexFDO

Authors Ayan Mahalanobis, Pralhad Shinde

Publication date 20 April 2018

Full work available at URL https://arxiv.org/abs/1711.07647

Mathematics Subject Classification ID

Cryptography (94A60)

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.

Recommendations

• Multilinear cryptography using nilpotent groups
• Cryptographic multilinear maps using pro-\(p\) groups
• On bilinear structures on divisor class groups
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• scientific article; zbMATH DE number 1996402

Cited in

(4)

• Algorithmic problems in Engel groups and cryptographic applications
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Cryptographic multilinear maps using pro-\(p\) groups
• Multilinear cryptography using nilpotent groups

This page was built for publication: Bilinear cryptography using groups of nilpotency class 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744849)