Paper 2011/048

A non-Abelian factorization problem and an associated cryptosystem

Srinath Baba, Srinivas Kotyad, and Raghu Teja

Abstract

In this note, we define a cryptosystem based on non-commutative properties of groups. The cryptosystem is based on the hardness of the problem of factoring over these groups. This problem, interestingly, boils down to discrete logarithm problem on some Abelian groups. Further, we illustrate this method in three different non-Abelian groups GL$_n({{\mathbb{F}}_q})$, UT$_n({{\mathbb{F}}_q})$ and the Braid Groups.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Non-abelian GroupsBraid GroupsGL$_n({{\mathbb{F}}_q})$UT$_n({{\mathbb{F}}_q})$
Contact author(s)
srini @ imsc res in
History
2011-01-26: received
Short URL
https://ia.cr/2011/048
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/048,
      author = {Srinath Baba and Srinivas Kotyad and Raghu Teja},
      title = {A non-Abelian factorization problem and an associated cryptosystem},
      howpublished = {Cryptology ePrint Archive, Paper 2011/048},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/048}},
      url = {https://eprint.iacr.org/2011/048}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.