Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208): Difference between revisions

@@ Property / cites work @@
+Polynomial basis multiplication over \(\text{GF}(2^m)\)
+Normal rank
@@ Property / cites work @@
+A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
+Normal rank
@@ Property / cites work @@
+Mastrovito multiplier for general irreducible polynomials
+Normal rank
@@ Property / cites work @@
+Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
+Normal rank
@@ Property / cites work @@
+Q4301239
@@ Property / cites work: Q4301239 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3827945
@@ Property / cites work: Q3827945 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel multipliers based on special irreducible pentanomials
+Normal rank
@@ Property / cites work @@
+Mastrovito multiplier for all trinomials
@@ Property / cites work: Mastrovito multiplier for all trinomials / rank @@
+Normal rank
@@ Property / cites work @@
+Bit-parallel finite field multiplier and squarer using polynomial basis
+Normal rank
@@ Property / cites work @@
+Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields
+Normal rank
@@ Property / cites work @@
+Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
+Normal rank