Gaussian elimination in unitary groups with an application to cryptography
arXiv:1409.6136v2
AI Analysis
This work addresses cryptographic security by enabling new cryptosystem designs, though it is incremental as it adapts an existing method to a new group type.
The paper extends Gaussian elimination to unitary groups to solve the word problem, and applies this to build a public-key cryptosystem.
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.