Gaussian elimination in unitary groups with an application to cryptography
classification
🧮 math.GR
cs.CR
keywords
eliminationgaussiangroupsapplicationunitaryalgorithmsbuildingcryptography
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.