EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

Ayan Mahalanobis, Anupam Singh

Journal of Algebra Combinatorics Discrete Structures and Applications · 15.09.2017 · 4 (3) · 247-260

DOI: 10.13069/jacodesmath.327373 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebra Combinatorics Discrete Structures and Applications, online erschienen am 15.09.2017. Verfasst von Ayan Mahalanobis und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Mahalanobis, A., & Singh, A. (2017). Gaussian elimination in split unitary groups with an application to public-key cryptography. Journal of Algebra Combinatorics Discrete Structures and Applications, 4(3), 247-260. https://doi.org/10.13069/jacodesmath.327373

Vancouver

Mahalanobis A, Singh A. Gaussian elimination in split unitary groups with an application to public-key cryptography. Journal of Algebra Combinatorics Discrete Structures and Applications. 2017;4(3):247-260. doi:10.13069/jacodesmath.327373

BibTeX
@article{Mahalanobis2017,
  author = {Mahalanobis, Ayan and Singh, Anupam},
  title = {Gaussian elimination in split unitary groups with an application to public-key cryptography},
  journal = {Journal of Algebra Combinatorics Discrete Structures and Applications},
  year = {2017},
  volume = {4},
  number = {3},
  pages = {247--260},
  doi = {10.13069/jacodesmath.327373}
}
Kostenlos starten →