Pages that link to "Item:Q2639102"

The following pages link to Constructing normal bases in finite fields (Q2639102):

Displaying 16 items.

• A new criterion on normal bases of finite field extensions (Q473081) (← links)
• Specific irreducible polynomials with linearly independent roots over finite fields (Q677139) (← links)
• Efficient and optimal exponentiation in finite fields (Q685709) (← links)
• Processor-efficient exponentiation in finite fields (Q1186580) (← links)
• Trace- and norm-compatible extensions of finite fields (Q1205131) (← links)
• Density of normal elements (Q1266417) (← links)
• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms (Q1361771) (← links)
• Normal bases and irreducible polynomials (Q1696761) (← links)
• On the density of normal bases in finite fields (Q1971063) (← links)
• Subquadratic-time algorithms for normal bases (Q2040602) (← links)
• Existence results on \(k\)-normal elements over finite fields (Q2313563) (← links)
• Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
• CONSTRUCTION OF SELF-DUAL INTEGRAL NORMAL BASES IN ABELIAN EXTENSIONS OF FINITE AND LOCAL FIELDS (Q3067878) (← links)
• On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other (Q5439060) (← links)
• Skew differential Goppa codes and their application to McEliece cryptosystem (Q6070353) (← links)
• Constructing irreducible polynomials recursively with a reverse composition method (Q6130613) (← links)