8 citations · 32 across the 25 of their papers we have counts for
10 papers · 1 filter
Symplectic Elimination
Ayan Mahalanobis
We develop the symplectic elimnation algorithm. This algorithm using simple row operations reduce a symplectic matrix to a diagonal matrix. This algorithm gives rise to a decomposi…
Algorithms in Linear Algebraic Groups
Sushil Bhunia, Ayan Mahalanobis, Pralhad Shinde +1
This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorith…
Gaussian Elimination in Symplectic and split orthogonal groups
Sushil Bhunia, Ayan Mahalanobis, Pralhad Shinde +1
This paper studies an algorithm similar to that of Gaussian elimination in symplectic and orthogonal groups. We discuss two applications of this algorithm in computational group th…
Gaussian elimination in unitary groups with an application to cryptography
Ayan Mahalanobis, Anupam Singh
Gaussian elimination is used in special linear groups to solve the word problem. In this paper, we extend Gaussian elimination to unitary groups. These algorithms have an applicati…
MOR Cryptosystem and classical Chevalley groups in odd characteristic
Ayan Mahalanobis, Anupam Singh
In this paper we study the MOR cryptosystem using finite classical Chevalley groups over a finite field of odd characteristic. In the process we develop an algorithm for these Chev…
The MOR cryptosystem and finite -groups
Ayan Mahalanobis
The ElGamal cryptosystem is the most widely used public key cryptosystem. It uses the discrete logarithm problem as the cryptographic primitive. The MOR cryptosystem is a similar c…