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).
Stories per day · 30 days
2 stories, newest first · one card per story
Stories tagged #polynomials
Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial Intersection
New bounds break Shamir secret sharing's one-half local-leakage barrier and improve optimal polynomial intersection.