Irreducible trinomials over finite fields
From MaRDI portal
Publication:4417173
DOI10.1090/S0025-5718-03-01515-1zbMath1083.11078MaRDI QIDQ4417173
Publication date: 28 July 2003
Published in: Mathematics of Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items
On the distribution of irreducible trinomials over \(\mathbb F_3\) ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ Division of trinomials by pentanomials and orthogonal arrays ⋮ Consensus of first-order discrete-time multi-agent systems with time delays ⋮ Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields ⋮ Construction of isodual codes from polycirculant matrices ⋮ Swan-like results for binomials and trinomials over finite fields of odd characteristic ⋮ Free storage basis conversion over finite fields ⋮ Division of tetranomials by type II pentanomials and orthogonal arrays ⋮ Parity of the number of irreducible factors for composite polynomials ⋮ On the number of equivalence classes of attracting dynamical systems ⋮ A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields ⋮ Almost-nonsingular entry pattern matrices ⋮ On Sets of Irreducible Polynomials Closed by Composition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On certain trinomial equations in finite fields
- On binary cyclic codes with minimum distance \(d=3\).
- Factorization of polynomials over finite fields
- Factorization of trinomials over Galois fields of characteristic 2
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Orthogonal arrays, primitive trinomials, and shift-register sequences
- Ireducible quadratic factors of \(x^{(q^n+1)/2}+ax+b\) over \(\mathbb{F}_q\)
- Algorithms for exponentiation in finite fields
- Advances in cryptology -- ASIACRYPT '96. International conference on the theory and applications of cryptology and information security, Kyongju, Korea, November 3--7, 1996. Proceedings
- On the minimum distances of non-binary cyclic codes
- Factorization of a special polynomial over a finite field
- On a theorem of Stickelberger
- On the irreducibility of certain trinomials
- On trinomials xn + x}2 + 1 and x8/ ± 3 + xk + 1 irreducible over GF(2)
- New families of almost perfect nonlinear power mappings
- Periodic binary sequences with the "trinomial property"
- A new approach of some problems concerning polynomials over finite fields
- On primitive trinomials (mod 2), II
- On xn + x + 1 over GF(2)
- Proof of a conjecture of S. Chowla
