scientific article; zbMATH DE number 429512
computational complexityalgebraic geometryelliptic curvesalgebraic complexity theoryautomatacryptographydiscrete logarithm problemfinite fieldsrational pointslinear recurring sequencesprimitive polynomialsfast algorithmsinteger factorizationirreducible polynomialscoding theoryfast exponentiationcomputer sciencealgebraic number theorypolynomial factorizationpolynomial multiplicationalgebraic curves over finite fieldspolynomials with integer coefficientsconstruction of basescomputational algebraic number theorydistribution of primitive pointsdistribution of primitive polynomialsfactorization of bivariate polynomialsstrengthening of the Weil-Serre bound
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Rational points (14G05) Curves over finite and local fields (11G20) Arithmetic theory of polynomial rings over finite fields (11T55) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Finite fields and commutative rings (number-theoretic aspects) (11Txx)
- 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
- On arithmetical algorithms over finite fields
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- Orders of Gauss periods in finite fields
- Fast message authentication using efficient polynomial evaluation
- The enumerability of P collapses P to NC
- scientific article; zbMATH DE number 1156677 (Why is no real title available?)
- Topics in Galois Fields
- Finite field towers: Iterated presentation and complexity of arithmetic.
- Counting curves and their projections
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- An improved Mordell type bound for exponential sums
- On group automata over finite fields.
- On upper bounds of Chalk and Hua for exponential sums
- Computing Frobenius maps and factoring polynomials
- Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\)
- Calculating the set of orders of elements in the finite linear groups
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- An algorithm for Lang's theorem.
- On the subfield subcodes of Hermitian codes
- Almost weakly self-dual bases for finite fields
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- scientific article; zbMATH DE number 6308159 (Why is no real title available?)
- On finding primitive roots in finite fields
- scientific article; zbMATH DE number 1408405 (Why is no real title available?)
- Factoring polynomials over arbitrary finite fields
- scientific article; zbMATH DE number 7228861 (Why is no real title available?)
- Distinct Degree Factorizations for Polynomials over a Finite Field
- A note on character sums with polynomial arguments.
- Long binary narrow-sense BCH codes are normal
- A deterministic test for permutation polynomials
- Non-standard finite fields over \(I\Delta_0+\Omega_1\)
- The computational complexity of recognizing permutation functions
- Primitive Normal Polynomials Over Finite Fields
- Generators and irreducible polynomials over finite fields
- On irreducible polynomials of small height over finite fields
- On some approximation problems concerning sparse polynomials over finite fields
- Finite integer computations: An algebraic foundation for their correctness
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)
