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

Abstract

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