activity
20212026
most citedElliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.CR2021

A verified algebraic representation of Cairo program execution

Jeremy Avigad, Lior Goldberg, David Levit +2

Cryptographic interactive proof systems provide an efficient and scalable means of verifying the results of computation on blockchain. A prover constructs a proof, off-chain, that…

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…