Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

DOI10.1007/978-3-540-69499-1_8zbMath1246.12006OpenAlexW1573440242MaRDI QIDQ3519554

Christophe Negre, M. Anwarul 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Finite fields (field-theoretic aspects) (12E20)

Cites Work

• Unnamed Item
• 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

This page was built for publication: Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation