2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.DS2021★ 2 cited
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty +1
For smooth finite fields (i.e., when factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomi…
cs.CC2019
DEEP-FRI: Sampling outside the box improves soundness
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty +1
Motivated by the quest for scalable and succinct zero knowledge arguments, we revisit worst-case-to-average-case reductions for linear spaces, raised by [Rothblum, Vadhan, Wigderso…
cs.IT2004
Robust Locally Testable Codes and Products of Codes
Eli Ben-Sasson, Madhu Sudan
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining i…