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

Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3356

Full metadata record

DC Field	Value	Language
dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.contributor.author	SINGH, ANUPAM KUMAR	en_US
dc.date.accessioned	2019-07-01T05:37:44Z
dc.date.available	2019-07-01T05:37:44Z
dc.date.issued	2017-01	en_US
dc.identifier.citation	Journal of Algebra Combinatorics Discrete Structures and Applications, 4(3), 247-260.	en_US
dc.identifier.issn	2148-838X	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3356	-
dc.identifier.uri	https://doi.org/10.13069/jacodesmath.327373	en_US
dc.description.abstract	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.	en_US
dc.language.iso	en	en_US
dc.publisher	Yildiz Technical University	en_US
dc.subject	Unitary groups	en_US
dc.subject	Gaussian elimination	en_US
dc.subject	Row-column operations	en_US
dc.subject	2017	en_US
dc.title	Gaussian elimination in split unitary groups with an application to public-key cryptography	en_US
dc.type	Article	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.sourcetitle	Journal of Algebra Combinatorics Discrete Structures and Applications	en_US
dc.publication.originofpublisher	Foreign	en_US
Appears in Collections:	JOURNAL ARTICLES

Files in This Item:

There are no files associated with this item.