A survey of some recent bit-parallel $\mathrm{GF}(2^n)$ multipliers (Q2512883): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ffa.2014.10.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2082081063
@@ Property / OpenAlex ID: W2082081063 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of Finite Fields
@@ Property / cites work: Handbook of Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Q4718481
@@ Property / cites work: Q4718481 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4826108
@@ Property / cites work: Q4826108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3597518
@@ Property / cites work: Q3597518 / rank @@
+Normal rank
@@ Property / cites work @@
+On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)
+Normal rank
@@ Property / cites work @@
+Q4406533
@@ Property / cites work: Q4406533 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4797793
@@ Property / cites work: Q4797793 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
+Normal rank
@@ Property / cites work @@
+High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields
+Normal rank
@@ Property / cites work @@
+Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
+Normal rank
@@ Property / cites work @@
+Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)
+Normal rank
@@ Property / cites work @@
+Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
+Normal rank
@@ Property / cites work @@
+Parallel multipliers based on special irreducible pentanomials
+Normal rank
@@ Property / cites work @@
+Fast Bit Parallel-Shifted Polynomial Basis Multipliers in &amp;lt;formula formulatype="inline"&amp;gt;&amp;lt;tex&amp;gt;$GF(2^{n})$&amp;lt;/tex&amp;gt;&amp;lt;/formula&amp;gt;
+Normal rank
@@ Property / cites work @@
+Fast Parallel GF(2^m) Polynomial Multiplication for All Degrees
+Normal rank
@@ Property / cites work @@
+Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
+Normal rank
@@ Property / cites work @@
+Q3595109
@@ Property / cites work: Q3595109 / rank @@
+Normal rank
@@ Property / cites work @@
+Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields
+Normal rank
@@ Property / cites work @@
+Efficient bit-parallel multipliers over finite fields GF\((2^m)\)
+Normal rank
@@ Property / cites work @@
+Bit-parallel finite field multiplier and squarer using polynomial basis
+Normal rank
@@ Property / cites work @@
+Q4470462
@@ Property / cites work: Q4470462 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast message authentication using efficient polynomial evaluation
+Normal rank
@@ Property / cites work @@
+GF(2/sup m/) multiplication and division over the dual basis
+Normal rank
@@ Property / cites work @@
+Mastrovito multiplier for all trinomials
@@ Property / cites work: Mastrovito multiplier for all trinomials / rank @@
+Normal rank
@@ Property / cites work @@
+Mastrovito multiplier for general irreducible polynomials
+Normal rank
@@ Property / cites work @@
+Modular Multiplication Without Trial Division
@@ Property / cites work: Modular Multiplication Without Trial Division / rank @@
+Normal rank
@@ Property / cites work @@
+Montgomery multiplication in \(\text{GF}(2^ k)\)
@@ Property / cites work: Montgomery multiplication in \(\text{GF}(2^ k)\) / rank @@
+Normal rank
@@ Property / cites work @@
+Montgomery multiplier and squarer for a class of finite fields
+Normal rank
@@ Property / cites work @@
+Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Bit-Parallel GF(2^m) Multiplier for a Large Class of Irreducible Pentanomials
+Normal rank
@@ Property / cites work @@
+Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)
+Normal rank
@@ Property / cites work @@
+Q3827945
@@ Property / cites work: Q3827945 / rank @@
+Normal rank
@@ Property / cites work @@
+Information Security and Cryptology - ICISC 2003
@@ Property / cites work: Information Security and Cryptology - ICISC 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+New low-complexity bit-parallel finite field multipliers using weakly dual bases
+Normal rank
@@ Property / cites work @@
+A Novel Architecture for Galois Fields GF(2^m) Multipliers Based on Mastrovito Scheme
+Normal rank
@@ Property / cites work @@
+Bit-serial Reed - Solomon encoders
@@ Property / cites work: Bit-serial Reed - Solomon encoders / rank @@
+Normal rank
@@ Property / cites work @@
+Dual bases and bit-serial multiplication in \(\mathbb F_q^n\).
+Normal rank
@@ Property / cites work @@
+Bit Serial Multiplication in Finite Fields
@@ Property / cites work: Bit Serial Multiplication in Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+On bit-serial multiplication and dual bases in GF(2/sup m/)
+Normal rank
@@ Property / cites work @@
+Q4695307
@@ Property / cites work: Q4695307 / rank @@
+Normal rank
@@ Property / cites work @@
+Architecture for a low complexity rate-adaptive Reed-Solomon encoder
+Normal rank
@@ Property / cites work @@
+Architectures for exponentiation in GF(2n)
@@ Property / cites work: Architectures for exponentiation in GF(2n) / rank @@
+Normal rank
@@ Property / cites work @@
+A Very Compact S-Box for AES
@@ Property / cites work: A Very Compact S-Box for AES / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and High-Performance Parallel Hardware Architectures for the AES-GCM
+Normal rank
@@ Property / cites work @@
+High-Speed Architectures for Multiplication Using Reordered Normal Basis
+Normal rank
@@ Property / cites work @@
+A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
+Normal rank
@@ Property / cites work @@
+Optimal normal bases in \(GF(p^ n)\)
@@ Property / cites work: Optimal normal bases in \(GF(p^ n)\) / rank @@
+Normal rank
@@ Property / cites work @@
+A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier
+Normal rank
@@ Property / cites work @@
+Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases
+Normal rank
@@ Property / cites work @@
+Gauss periods: orders and cryptographical applications
+Normal rank
@@ Property / cites work @@
+Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
+Normal rank
@@ Property / cites work @@
+Finite field arithmetic using quasi-normal bases
@@ Property / cites work: Finite field arithmetic using quasi-normal bases / rank @@
+Normal rank
@@ Property / cites work @@
+Area—Time Optimal VLSI Circuits for Convolution
@@ Property / cites work: Area—Time Optimal VLSI Circuits for Convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q3727381
@@ Property / cites work: Q3727381 / rank @@
+Normal rank
@@ Property / cites work @@
+AT/sup 2/-optimal Galois field multiplier for VLSI
+Normal rank
@@ Property / cites work @@
+Q5601777
@@ Property / cites work: Q5601777 / rank @@
+Normal rank
@@ Property / cites work @@
+A new architecture for a parallel finite field multiplier with low complexity based on composite fields
+Normal rank
@@ Property / cites work @@
+Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
+Normal rank
@@ Property / cites work @@
+A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
+Normal rank
@@ Property / cites work @@
+Q3883493
@@ Property / cites work: Q3883493 / rank @@
+Normal rank
@@ Property / cites work @@
+A classification of algorithms for multiplying polynomials of small degree over finite fields
+Normal rank
@@ Property / cites work @@
+Five, six, and seven-term Karatsuba-like formulae
@@ Property / cites work: Five, six, and seven-term Karatsuba-like formulae / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Optimal Formulae for Bilinear Maps
@@ Property / cites work: Finding Optimal Formulae for Bilinear Maps / rank @@
+Normal rank
@@ Property / cites work @@
+Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
+Normal rank
@@ Property / cites work @@
+Batch Binary Edwards
@@ Property / cites work: Batch Binary Edwards / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products
+Normal rank
@@ Property / cites work @@
+Multiway Splitting Method for Toeplitz Matrix Vector Product
+Normal rank
@@ Property / cites work @@
+On the complexity of multiplication in finite fields
+Normal rank
@@ Property / cites work @@
+Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
+Normal rank
@@ Property / cites work @@
+Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
+Normal rank
@@ Property / cites work @@
+Improved n-Term Karatsuba-Like Formulas in GF(2)
@@ Property / cites work: Improved n-Term Karatsuba-Like Formulas in GF(2) / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplication of polynomials modulo \(x^n\)
@@ Property / cites work: Multiplication of polynomials modulo \(x^n\) / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
+Normal rank
@@ Property / cites work @@
+A lower bound for polynomial multiplication
@@ Property / cites work: A lower bound for polynomial multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplicative complexity of polynomial multiplication over finite fields
+Normal rank
@@ Property / cites work @@
+Q3900988
@@ Property / cites work: Q3900988 / rank @@
+Normal rank
@@ Property / cites work @@
+A long note on Mulders' short product
@@ Property / cites work: A long note on Mulders' short product / rank @@
+Normal rank
@@ Property / cites work @@
+Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
+Normal rank
@@ Property / cites work @@
+A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
+Normal rank
@@ Property / cites work @@
+Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product
+Normal rank
@@ Property / cites work @@
+Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
+Normal rank
@@ Property / cites work @@
+Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
+Normal rank
@@ Property / cites work @@
+Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation
+Normal rank
@@ Property / cites work @@
+Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
+Normal rank
@@ Property / cites work @@
+Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
+Normal rank
@@ Property / cites work @@
+Efficient hardware implementation of finite fields with applications to cryptography
+Normal rank
@@ Property / cites work @@
+Polynomial basis multiplication over \(\text{GF}(2^m)\)
+Normal rank
@@ Property / cites work @@
+Q4536221
@@ Property / cites work: Q4536221 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536233
@@ Property / cites work: Q4536233 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4797796
@@ Property / cites work: Q4797796 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4425738
@@ Property / cites work: Q4425738 / rank @@
+Normal rank
@@ Property / cites work @@
+A Word-Level Finite Field Multiplier Using Normal Basis
+Normal rank
@@ Property / cites work @@
+Fast Inversion in &lt;formula formulatype="inline"&gt;&lt;tex Notation="TeX"&gt;${\schmi{GF(2^m)}}$&lt;/tex&gt;&lt;/formula&gt; with Normal Basis Using Hybrid-Double Multipliers
+Normal rank
@@ Property / cites work @@
+Look-up table-based large finite field multiplication in memory constrained cryptosystems
+Normal rank
@@ Property / cites work @@
+Elliptic curve cryptosystems over small fields of odd characteristic
+Normal rank
@@ Property / cites work @@
+Q4783728
@@ Property / cites work: Q4783728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4425740
@@ Property / cites work: Q4425740 / rank @@
+Normal rank
@@ Property / cites work @@
+A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
+Normal rank
@@ Property / cites work @@
+Hardware Acceleration of the Tate Pairing in Characteristic Three
+Normal rank
@@ Property / cites work @@
+Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
+Normal rank
@@ Property / cites work @@
+Efficient Multiplication in Finite Field Extensions of Degree 5
+Normal rank

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883): Difference between revisions

Latest revision as of 15:37, 9 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)