A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier

DOI10.1007/978-3-642-13797-6_3zbMath1231.68033OpenAlexW1764137175MaRDI QIDQ3578463

Arash Reyhani-Masoleh, Reza Azarderakhsh

Publication date: 20 July 2010

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13797-6_3

zbMATH Keywords

finite fieldcomplexity reductionGaussian normal basisdigit-serial multiplier

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier