Pages that link to "Item:Q910432"

The following pages link to On arithmetical algorithms over finite fields (Q910432):

Displaying 22 items.

• Complexity of computation in finite fields (Q378003) (← links)
• Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
• Fast arithmetic with general Gauß periods (Q598216) (← links)
• Harmonic analysis on \(\text{GF}(p^{p^\infty})\). I. (Q984764) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Computational problems in the theory of finite fields (Q1180998) (← links)
• On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
• Algorithms for exponentiation in finite fields (Q1581128) (← links)
• Fast transforms over finite fields of characteristic two (Q2229746) (← links)
• Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
• On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
• A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
• Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering (Q3644213) (← links)
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2 (Q4235525) (← links)
• The black-box Niederreiter algorithm and its implementation over the binary field (Q4417166) (← links)
• Isomorphisms between Artin-Schreier towers (Q4501043) (← links)
• Computing special powers in finite fields (Q4813594) (← links)
• (Q5150372) (← links)
• Faster Multiplication in GF(2)[x] (Q5387595) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)
• Entropically secure encryption with faster key expansion (Q6492513) (← links)