4 citations · 12 across the 5 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2009★ 1 cited
The discrete logarithm problem in the group of non-singular circulant matrices
Ayan Mahalanobis
The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a f…
cs.CR2007★ 4 cited
A note on using finite non-abelian -groups in the MOR cryptosystem
Ayan Mahalanobis
The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a -group, a cryptosystem was built by this author in 'A simple general…
cs.CR2006
A simple generalization of El-Gamal cryptosystem to non-abelian groups
Ayan Mahalanobis
In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptos…