Comb Architectures for Finite Field Multiplication in F(2ᵐ)

DOI10.1109/TC.2007.1047MaRDI QIDQ4564185zbMATH OpenOpenAlexFDO

Authors Ashkan Hosseinzadeh Namin, Huapeng Wu, M. Ahmadi

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2007.1047

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Numerical algorithms for computer arithmetic, etc. (65Y04) Mathematical problems of computer architecture (68M07)

Cited in

(4)

• Efficient systolic multiplications in composite fields for cryptographic systems
• scientific article; zbMATH DE number 2024675 (Why is no real title available?)
• On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits"
• Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"

This page was built for publication: Comb Architectures for Finite Field Multiplication in F(2^m)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564185)