Author

Sort by: Order: Results:

  • On improvements of the r-adding walk in a finite field of characteristic 2 
    Abdullah, Ansari; Gajera, Hardik; MAHALANOBIS, AYAN (Taylor & Francis, 2016-10)
    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 where N is the order of the group. In many ...
  • A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem 
    MAHALANOBIS, AYAN; MALLICK, VIVEK MOHAN; Abdullah, Ansari (Springer Nature, 2018-12)
    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 on an elliptic curve and is thus not a generic ...

Search Repository


Advanced Search

Browse

My Account