On some problems in the theory of finite fields

DOI10.1070/RM1991v046n01ABEH002725zbMath0742.11058OpenAlexW2017833524MaRDI QIDQ4000588

Igor E. Shparlinski

Publication date: 26 September 1992

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm1991v046n01abeh002725

zbMATH Keywords

bibliographypolynomialsapplicationsalgebraic curvesfactorizationcoding theoryirreducible polynomialsprimitive polynomialsrecurrent sequencesconstruction of basesalgorithmic problems in finite fields

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Polynomials over finite fields (11T06) Exponential sums (11T23) Other character sums and Gauss sums (11T24) Arithmetic theory of polynomial rings over finite fields (11T55) Finite fields and commutative rings (number-theoretic aspects) (11Txx)

Related Items (1)

Cellular automata and finite fields

Uses Software

• FAST16

This page was built for publication: On some problems in the theory of finite fields