Gaussian elimination in split unitary groups with an application to public-key cryptography

Simple item page
dc.contributor.authorMAHALANOBIS, AYANen_US
dc.contributor.authorSINGH, ANUPAM KUMARen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.date.accessioned2019-07-01T05:37:44Z
dc.date.available2019-07-01T05:37:44Z
dc.date.issued2017-01en_US
dc.description.abstractGaussian 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.en_US
dc.identifier.citationJournal of Algebra Combinatorics Discrete Structures and Applications, 4(3), 247-260.en_US
dc.identifier.issn2148-838Xen_US
dc.identifier.sourcetitleJournal of Algebra Combinatorics Discrete Structures and Applicationsen_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3356
dc.identifier.urihttps://doi.org/10.13069/jacodesmath.327373
dc.language.isoenen_US
dc.publication.originofpublisherForeignen_US
dc.publisherYildiz Technical Universityen_US
dc.subjectUnitary groupsen_US
dc.subjectGaussian eliminationen_US
dc.subjectRow-column operationsen_US
dc.subject2017en_US
dc.titleGaussian elimination in split unitary groups with an application to public-key cryptographyen_US
dc.typeArticleen_US

Files

Collections

JOURNAL ARTICLES