scientific article; zbMATH DE number 429512
elliptic curvesstrengthening of the Weil-Serre boundrational pointsprimitive polynomialspolynomials with integer coefficientspolynomial multiplicationpolynomial factorizationlinear recurring sequencesirreducible polynomialsinteger factorizationfinite fieldsfast exponentiationfast algorithmsfactorization of bivariate polynomialsalgebraic complexity theorydistribution of primitive polynomialsdistribution of primitive pointsdiscrete logarithm problemcryptographyconstruction of basescomputer sciencecomputational complexitycomputational algebraic number theorycoding theoryautomataalgebraic number theoryalgebraic geometryalgebraic curves over finite fields
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Curves over finite and local fields (11G20) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields and commutative rings (number-theoretic aspects) (11Txx) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Rational points (14G05) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
- Computational problems in the theory of finite fields
- scientific article; zbMATH DE number 4152523
- scientific article; zbMATH DE number 6308159
- Algorithms for finite field arithmetic
- On arithmetical algorithms over finite fields
- Complexity of computation in finite fields
- scientific article; zbMATH DE number 1440131
- Finite fields and applications
- scientific article; zbMATH DE number 4083539
- scientific article; zbMATH DE number 3119358
- Computational problems in the theory of finite fields
- A deterministic test for permutation polynomials
- On some approximation problems concerning sparse polynomials over finite fields
- On finding primitive roots in finite fields
- Almost weakly self-dual bases for finite fields
- Long binary narrow-sense BCH codes are normal
- A note on character sums with polynomial arguments.
- On group automata over finite fields.
- Non-standard finite fields over \(I\Delta_0+\Omega_1\)
- Factoring polynomials over arbitrary finite fields
- Finite field towers: Iterated presentation and complexity of arithmetic.
- On irreducible polynomials of small height over finite fields
- Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\)
- Computing Frobenius maps and factoring polynomials
- Finite integer computations: An algebraic foundation for their correctness
- On the subfield subcodes of Hermitian codes
- The enumerability of P collapses P to NC
- On upper bounds of Chalk and Hua for exponential sums
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 7228861 (Why is no real title available?)
- scientific article; zbMATH DE number 4198135 (Why is no real title available?)
- Calculating the set of orders of elements in the finite linear groups
- Primitive Normal Polynomials Over Finite Fields
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Generators and irreducible polynomials over finite fields
- scientific article; zbMATH DE number 1156677 (Why is no real title available?)
- Fast message authentication using efficient polynomial evaluation
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- An improved Mordell type bound for exponential sums
- Distinct Degree Factorizations for Polynomials over a Finite Field
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- scientific article; zbMATH DE number 1408405 (Why is no real title available?)
- scientific article; zbMATH DE number 6308159 (Why is no real title available?)
- Topics in Galois Fields
- The computational complexity of recognizing permutation functions
- Orders of Gauss periods in finite fields
- Counting curves and their projections
- An algorithm for Lang's theorem.
- On arithmetical algorithms over finite fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137899)
