Pages that link to "Item:Q4206833"

The following pages link to Generalised fast algorithm for computing multiplicative inverses in<i>GF</i>(2^m) (Q4206833):

Displaying 12 items.

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases (Q1120276) (← links)
• Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\) (Q1705651) (← links)
• HECC Goes Embedded: An Area-Efficient Implementation of HECC (Q3644216) (← links)
• The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime (Q3714154) (← links)
• A fast algorithm for multiplicative inverses based on the normal basis representation (Q3982564) (← links)
• A fast algorithm for multiplicative inverses based on the normal basis representation (Q3992201) (← links)
• Effective recursive algorithm for computing multiplicative inverses in GF(2m) (Q4206832) (← links)
• A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/) (Q4553217) (← links)
• Applied Cryptography and Network Security (Q4680967) (← links)
• Computing special powers in finite fields (Q4813594) (← links)
• On computing multiplicative inverses in GF(2/sup m/) (Q5375329) (← links)
• Computational Science and Its Applications – ICCSA 2004 (Q5712513) (← links)