scientific article; zbMATH DE number 1361739

zbMath0967.11052MaRDI QIDQ4699468

Igor E. Shparlinski

Publication date: 11 November 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

discrete mathematicsexponential sumselliptic curvesfinite fieldscryptographycongruencespolynomial factorizationalgebraic curvesbasescomputer sciencecyclic codescoding theorypermutation polynomialspseudo-random numbersalgebraic geometryirreducible polynomialsrecurrence sequencesnumber theorydiscrete logarithmalgebraic complexity theoryprimitive polynomialsinteger factorizationalgebraic number theoryprimality testingpolynomial multiplicationpolynomials with integer coefficientscomputational algebraic number theorycounting points on curves

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Rational points (14G05) Number-theoretic algorithms; complexity (11Y16) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Curves over finite and local fields (11G20) Polynomials over finite fields (11T06) Exponential sums (11T23) Random number generation in numerical analysis (65C10) Algebraic number theory computations (11Y40) Arithmetic theory of polynomial rings over finite fields (11T55) Factorization (11Y05) Primality (11Y11) Finite fields and commutative rings (number-theoretic aspects) (11Txx)

Related Items (33)

On the Carlitz rank of permutation polynomials ⋮ Pseudo-Boolean functions and the multiplicity of the zeros of polynomials ⋮ Recognising the small Ree groups in their natural representations. ⋮ Constructing composition factors for a linear group in polynomial time ⋮ A survey of some applications of finite fields ⋮ The Carlitz rank of permutations of finite fields: a survey ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ A practical model for computation with matrix groups. ⋮ On the cycle structure of permutation polynomials ⋮ Constructive Sylow theorems for the classical groups. ⋮ On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Irreducible polynomials with several prescribed coefficients ⋮ Factoring polynomials over finite fields: A survey ⋮ On the statistical properties of Diffie-Hellman distributions ⋮ Irrationality of power series for various number theoretic functions ⋮ On the nonlinearity of linear recurrence sequences ⋮ On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences ⋮ Computing Chevalley bases in small characteristics ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ Permutation polynomials and factorization ⋮ Unnamed Item ⋮ Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). ⋮ On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x\) to \(\mathbb{F}_q [x]\)] ⋮ Incomplete character sums and a special class of permutations ⋮ Algebraic integers with small absolute size ⋮ Zero testing of \(p\)-adic and modular polynomials ⋮ Explicit theorems on generator polynomials ⋮ On the construction of finite field elements of large order ⋮ Character sums and deterministic polynomial root finding in finite fields ⋮ Writing projective representations over subfields. ⋮ The number of permutation polynomials of a given degree over a finite field ⋮ Generalized Diophantine 𝑚-tuples

Uses Software

• Hull
• NTRU

This page was built for publication: