8 citations · 10 across the 9 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2020★ 8 cited
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…
cs.CR2017
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…