A survey of some recent bit-parallel GF(2ⁿ) multipliers
From MaRDI portal
Publication:2512883
Recommendations
- On low complexity bit parallel polynomial basis multipliers.
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
- Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)
Cites work
- A classification of algorithms for multiplying polynomials of small degree over finite fields
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
- A long note on Mulders' short product
- A lower bound for polynomial multiplication
- A modified low complexity digit-level Gaussian normal basis multiplier
- A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
- A new architecture for a parallel finite field multiplier with low complexity based on composite fields
- A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
- A Novel Architecture for Galois Fields GF(2ᵐ) Multipliers Based on Mastrovito Scheme
- A Very Compact S-Box for AES
- A Word-Level Finite Field Multiplier Using Normal Basis
- Architecture for a low complexity rate-adaptive Reed-Solomon encoder
- Architectures for exponentiation in GF(2n)
- Area—Time Optimal VLSI Circuits for Convolution
- AT/sup 2/-optimal Galois field multiplier for VLSI
- Batch Binary Edwards
- Bit Serial Multiplication in Finite Fields
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields
- Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2ᵐ)
- Bit-serial Reed - Solomon encoders
- Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)
- Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product
- Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Dual bases and bit-serial multiplication in \(\mathbb F_q^n\).
- Efficient and High-Performance Parallel Hardware Architectures for the AES-GCM
- Efficient Bit-Parallel GF(2^m) Multiplier for a Large Class of Irreducible Pentanomials
- Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
- Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
- Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
- Efficient hardware implementation of finite fields with applications to cryptography
- Efficient multiplication in finite field extensions of degree 5
- Elliptic curve cryptosystems over small fields of odd characteristic
- Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
- Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>
- Fast Inversion in <formula formulatype="inline"><tex Notation="TeX">${\schmi{GF(2^m)}}$</tex></formula> with Normal Basis Using Hybrid-Double Multipliers
- Fast message authentication using efficient polynomial evaluation
- Fast Parallel GF(2^m) Polynomial Multiplication for All Degrees
- Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
- Finding optimal formulae for bilinear maps
- Finite field arithmetic using quasi-normal bases
- Five, six, and seven-term Karatsuba-like formulae
- Gauss periods: orders and cryptographical applications
- GF(2/sup m/) multiplication and division over the dual basis
- Handbook of finite fields
- Hardware Acceleration of the Tate Pairing in Characteristic Three
- High speed cryptoprocessor for \(\eta _{T }\) pairing on 128-bit secure supersingular elliptic curves over characteristic two fields
- High-Speed Architectures for Multiplication Using Reordered Normal Basis
- scientific article; zbMATH DE number 5504474 (Why is no real title available?)
- scientific article; zbMATH DE number 3958728 (Why is no real title available?)
- scientific article; zbMATH DE number 4102996 (Why is no real title available?)
- scientific article; zbMATH DE number 3688713 (Why is no real title available?)
- scientific article; zbMATH DE number 3709576 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1979305 (Why is no real title available?)
- scientific article; zbMATH DE number 1979307 (Why is no real title available?)
- scientific article; zbMATH DE number 2077085 (Why is no real title available?)
- scientific article; zbMATH DE number 1759291 (Why is no real title available?)
- scientific article; zbMATH DE number 1759300 (Why is no real title available?)
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1878331 (Why is no real title available?)
- scientific article; zbMATH DE number 1878334 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
- Improved n-Term Karatsuba-Like Formulas in GF(2)
- Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
- Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products
- Information Security and Cryptology - ICISC 2003
- Irreducible polynomials of maximum weight
- Look-up table-based large finite field multiplication in memory constrained cryptosystems
- Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
- Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases
- Mastrovito multiplier for all trinomials
- Mastrovito multiplier for general irreducible polynomials
- Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)
- Modular Multiplication Without Trial Division
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- Montgomery multiplier and squarer for a class of finite fields
- Multiplication of polynomials modulo \(x^n\)
- Multiplicative complexity of polynomial multiplication over finite fields
- Multiway Splitting Method for Toeplitz Matrix Vector Product
- New low-complexity bit-parallel finite field multipliers using weakly dual bases
- On bit-serial multiplication and dual bases in GF(2/sup m/)
- On the complexity of multiplication in finite fields
- On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
- Optimal normal bases in \(GF(p^ n)\)
- Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
- Parallel multipliers based on special irreducible pentanomials
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
- Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation
- Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
- Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
Cited in
(5)- Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
- A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)
- A three-term Karatsuba multiplier for a special class of trinomials
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
This page was built for publication: A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512883)
