New bounds limit polynomial approximations of the discrete logarithm
The degree-at-most-D agreement set is at most (1+o(1)) times the square root of Dp, and linear polynomials fall to O(p to the 2/5).
1 stories, newest first · one card per story
The degree-at-most-D agreement set is at most (1+o(1)) times the square root of Dp, and linear polynomials fall to O(p to the 2/5).
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views