Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
DOI10.1007/978-3-540-69499-1_8zbMATH Open1246.12006OpenAlexW1573440242MaRDI QIDQ3519554FDOQ3519554
Authors: Christophe Negre, M. Anwar Hasan 
Publication date: 19 August 2008
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_8
Recommendations
- Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation
- Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
- Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination
- A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
- Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
- Subquadratic-time factoring of polynomials over finite fields
- scientific article; zbMATH DE number 1263216
- Subquadratic Space-Complexity Digit-Serial Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> Using Generalized <formula formulatype="inline"><tex Notation="TeX">$(a,b)$</
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20)
Cites Work
Cited In (4)
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
- Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
- Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over <inline-formula> <tex-math notation="LaTeX">$GF(2^{m})$</tex-math> </inline-formula> Using Generalized <inline-formula> <tex-math notation="LaTeX">$(a, b)$</tex-math> </inline-formula>-Way Karatsuba Algorithm”
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
This page was built for publication: Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519554)
