Welcome to the resource topic for 2011/048
Title:
A non-Abelian factorization problem and an associated cryptosystem
Authors: 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.
ePrint: https://eprint.iacr.org/2011/048
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .