Explicit Nonlinear Functions beyond the Fourier bound
Cryptographers construct explicit highly nonlinear maps over finite fields that beat the classical Fourier agreement bound.
2 stories, newest first · one card per story
Cryptographers construct explicit highly nonlinear maps over finite fields that beat the classical Fourier agreement bound.
Fourier analysis bounds classical and quantum security of sums of random permutations.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views