An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (Q834951): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2004.08.009
@@ Property / DOI: 10.1016/j.ipl.2004.08.009 / rank @@
-Normal rank
@@ Property / author @@
-Hyun Sook Cho
@@ Property / author: Hyun Sook Cho / rank @@
-Normal rank
@@ Property / author @@
+Hyun Sook Cho
@@ Property / author: Hyun Sook Cho / 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.1016/j.ipl.2004.08.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1578834396
@@ Property / OpenAlex ID: W1578834396 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536202
@@ Property / cites work: Q4536202 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4364562
@@ Property / cites work: Q4364562 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
+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 @@
+Effective recursive algorithm for computing multiplicative inverses in GF(2m)
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2004.08.009
@@ Property / DOI: 10.1016/J.IPL.2004.08.009 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:834951