activity
20082025
most citedQuantum algorithms for computing short discrete logarithms and factoring RSA integers

61 citations · 83 across the 10 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.CC2011

Making the long code shorter, with applications to the Unique Games Conjecture

Boaz Barak, Parikshit Gopalan, Johan Hastad +3

The long code is a central tool in hardness of approximation, especially in questions related to the unique games conjecture. We construct a new code that is exponentially more eff…