8 citations · 8 across the 2 of their papers we have counts for
4 papers
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 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…
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
Ayan Mahalanobis, Vivek Mallick
In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of…
On improvements of the -adding walk in a finite field of characteristic 2
Ansari Abdullah, Hardik Gajera, Ayan Mahalanobis
It is currently known from the work of Shoup and Nechaev that a generic algorithm to solve the discrete logarithm problem in a group of prime order must have complexity at least $k…