Gaussian elimination in split unitary groups with an application to public-key cryptography
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yildiz Technical University
2017-07-01
|
| Series: | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Online Access: | http://jacodesmath.com/index.php/jacodesmath/article/view/140 |
| Summary: | 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. |
|---|---|
| ISSN: | 2148-838X |