Pages that link to "Item:Q2475900"

The following pages link to A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900):

Displaying 9 items.

• A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials (Q604106) (← links)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
• A low-complexity power-sum circuit for \(GF(2^m)\) and its applications (Q2732960) (← links)
• A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs (Q2989498) (← links)
• Exponentiation in finite fields using dual basis multiplier (Q3975197) (← links)
• (Q4408448) (← links)
• On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits" (Q4571241) (← links)
• Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over <inline-formula> <tex-math notation="LaTeX">$GF(2^{m})$</tex-math> </inline-formula> Using Generalized <inline-formula> <tex-math notation="LaTeX"&g (Q5007418) (← links)
• Computational Science and Its Applications – ICCSA 2004 (Q5712510) (← links)