8 citations · 32 across the 25 of their papers we have counts for
27 papers
A Guess and Determine Attack on the Elliptic Curve Discrete Logarithm Problem
Ayan Mahalanobis
This paper is a continuation of our earlier work, in which we described a Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The Las Vegas algorithm reduce…
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…
Minors solve the elliptic curve discrete logarithm problem
Ansari Abdullah, Ayan Mahalanobis
The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in com…
A McEliece cryptosystem using permutation codes
Adarsh Srinivasan, Ayan Mahalanobis
This paper is an attempt to build a new public-key cryptosystem; similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem…
A remark on MAKE -- a Matrix Action Key Exchange
Chris Monico, Ayan Mahalanobis
In a recent paper [arXiv:2009.00716], Rahman and Shpilrain proposed a new key-exchange protocol MAKE based on external semidirect product of groups. The purpose of this paper is to…
A new method for solving the elliptic curve discrete logarithm problem
Ansari Abdullah, Ayan Mahalanobis, Vivek M. Mallick
The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic cur…