Gaussian elimination in split unitary groups with an application to public-key cryptography

From MaRDI portal
Publication:5241157

zbMATH Open1428.20048arXiv1409.6136MaRDI QIDQ5241157FDOQ5241157


Authors:


Publication date: 30 October 2019

Abstract: Gaussian elimination is used in special linear groups to solve the word problem. In this paper, we extend Gaussian elimination to unitary groups. These algorithms have an application in building a public-key cryptosystem, we demonstrate that.


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




Recommendations




Cites Work


Uses Software





This page was built for publication: Gaussian elimination in split unitary groups with an application to public-key cryptography

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