scientific article; zbMATH DE number 5733040

MaRDI QIDQ3570803zbMATH OpenFDO

Authors Xin Wang, Xinmei Wang, Baodian Wei

Publication date 8 July 2010

zbMATH Keywords

finite fieldspolynomial time algorithmsequence cipherspread spectrum communication

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• A fast algorithm to compute irreducible and primitive polynomials in finite fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Deterministic irreducibility testing of polynomials over large finite fields
• scientific article; zbMATH DE number 177888
• scientific article; zbMATH DE number 4146067
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• scientific article; zbMATH DE number 3897066
• scientific article; zbMATH DE number 1273636
• Fast construction of irreducible polynomials over finite fields
• Fast construction of irreducible polynomials over finite fields

Cited in

(5)

• Algorithm for studying polynomial maps and reductions modulo prime number
• scientific article; zbMATH DE number 177888 (Why is no real title available?)
• An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial
• A polynomial time algorithm for computing the HNF of a module over the integers of a number field
• A perfect secret sharing scheme for general access structures

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 Q3570803)