Gaussian elimination in unitary groups with an application to cryptography
Group Theory
2015-11-05 v2 Cryptography and Security
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.
Cite
@article{arxiv.1409.6136,
title = {Gaussian elimination in unitary groups with an application to cryptography},
author = {Ayan Mahalanobis and Anupam Singh},
journal= {arXiv preprint arXiv:1409.6136},
year = {2015}
}