Polynomial Basis Multiplication over GF(2 m )

Serdar Süer Erdem; Tuğrul Yanık; Çetin Kaya Koç

doi:10.1007/s10440-006-9047-0

ScienceGate Book Chapters

JOURNAL ARTICLE

Polynomial Basis Multiplication over GF(2 m )

Serdar Süer Erdem Tuğrul Yanık Çetin Kaya Koç

Year: 2006 Journal: Acta Applicandae Mathematicae Vol: 93 (1-3)Pages: 33-55 Publisher: Springer Science+Business Media

DOI: 10.1007/s10440-006-9047-0

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Multiplication (music) Polynomial basis Basis (linear algebra) Polynomial Partial differential equation Algebra over a field Arithmetic Discrete mathematics Pure mathematics Combinatorics Mathematical analysis Geometry

Metrics

Cited By

5.74

FWCI (Field Weighted Citation Impact)

Refs

0.95

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

Polynomial and algebraic computation

Physical Sciences → Computer Science → Computational Theory and Mathematics

Polynomial Basis Multiplication over GF(2 m )

Metrics

Citation History

Topics

Related Documents

A Novel Approach for Multiplication over GF(2m) in Polynomial Basis Representation

Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)

New Bit-Level Serial GF (2^m) Multiplication Using Polynomial Basis

Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms

Low area-time complexity point multiplication architecture for ECC over GF($$2^{\textrm{m}}$$) using polynomial basis