Gaussian elimination in split unitary groups with an application to public-key cryptography
From MaRDI portal
Publication:5241157
zbMATH Open1428.20048arXiv1409.6136MaRDI QIDQ5241157FDOQ5241157
Authors:
Publication date: 30 October 2019
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.
Full work available at URL: https://arxiv.org/abs/1409.6136
Recommendations
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variations on a theme of Chevalley
- A practical model for computation with matrix groups.
- Title not available (Why is that?)
- On the automorphisms of the classical groups. With a supplement by Loo-Keng Hua
- Title not available (Why is that?)
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Constructive recognition of classical groups in odd characteristic.
- Constructive recognition of classical groups in their natural representation.
- Black box classical groups.
- Fast Constructive Recognition of Black-Box Unitary Groups
- Constructive membership testing in black-box classical groups.
- Computing in groups of Lie type
- Title not available (Why is that?)
- A simple generalization of the ElGamal cryptosystem to non-abelian groups. II
- Cryptanalysis of a matrix-based MOR system
- Mathematicians of Gaussian elimination
Uses Software
This page was built for publication: Gaussian elimination in split unitary groups with an application to public-key cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241157)