Pages that link to "Item:Q2120984"

The following pages link to Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields (Q2120984):

Displaying 9 items.

• Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm (Q512336) (← links)
• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) (Q1177865) (← links)
• On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation (Q2012337) (← links)
• On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields (Q2175409) (← links)
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields (Q2788750) (← links)
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves (Q4027853) (← links)
• (Q5446299) (← links)
• A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line (Q5880200) (← links)
• Chudnovsky-type algorithms over the projective line using generalized evaluation maps (Q6057235) (← links)