scientific article; zbMATH DE number 39192

MaRDI QIDQ3992201zbMATHFDO

Authors Dazhuan Xu

Publication date 27 June 1992

zbMATH Keywords

fast algorithmcomplexityfinite fieldnormal basismultiplicative inverses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 24470
• A new algorithm for multiplication in finite fields
• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Generalised fast algorithm for computing multiplicative inverses inGF(2^m)

Cited in

(6)

• Arithmetic operations in \(GF(2^ m)\)
• Effective recursive algorithm for computing multiplicative inverses in GF(2m)
• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• An extension of TYT inversion algorithm in polynomial basis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992201)