A non-Abelian factorization problem and an associated cryptosystem

Srinath Baba; Srinivas Kotyad; Raghu Teja

Paper 2011/048 Original: eprint.iacr.org/2011/048 ↗

A non-Abelian factorization problem and an associated cryptosystem

Srinath Baba

Srinivas Kotyad

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: Preprint.
History: 2011-01-26: last updated; 2011-01-26: published
Short URL: https://ia.cr/2011/048
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2011/048}
}