A Euclidean algorithm for normal bases (Q850785): Difference between revisions

@@ Property / author @@
-Berk Sunar
@@ Property / author: Berk Sunar / rank @@
-Normal rank
@@ Property / author @@
+Berk Sunar
@@ Property / author: Berk Sunar / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Maple
@@ Property / describes a project that uses: Maple / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10440-006-9048-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2111458214
@@ Property / OpenAlex ID: W2111458214 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4789443
@@ Property / cites work: Q4789443 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
+Normal rank
@@ Property / cites work @@
+Q3935355
@@ Property / cites work: Q3935355 / rank @@
+Normal rank
@@ Property / cites work @@
+Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
+Normal rank
@@ Property / cites work @@
+Q3216750
@@ Property / cites work: Q3216750 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient optimal normal basis type II multiplier
+Normal rank
@@ Property / cites work @@
+VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>)
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:850785