Sort by: Order: Results:

  • 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 ...