Chapter Measures of Pseudorandomness
Author(s)
Gyarmati, Katalin
Contributor(s)
Charpin, Pascale (editor)
Pott, Alexander (editor)
Winterhof, Arne (editor)
Collection
European Research Council (ERC)Language
EnglishAbstract
In the second half of the 1990s Christian Mauduit and András Sárközy [86] introduced a new quantitative theory of pseudorandomness of binary sequences. Since then numerous papers have been written on this subject and the original theory has been generalized in several directions. Here I give a survey of some of the most important results involving the new quantitative pseudorandom measures of finite bi-nary sequences. This area has strong connections to finite fields, in particular, some of the best known constructions are defined using characters of finite fields and their pseudorandom measures are estimated via character sums.
Keywords
Character sum; Exponential sum; Permutation Polynomial; Almost Perfect Nonlinear Function; Finite FieldDOI
10.1515/9783110283600.43ISBN
9783110282405OCN
1135845523Publisher
De GruyterPublisher website
https://www.degruyter.com/Publication date and place
Berlin/Boston, 2013Grantor
Classification
Algebra
Applied mathematics
Computer science