scientific article; zbMATH DE number 1980961

MaRDI QIDQ4428346zbMATH OpenFDO

Authors Soonhak Kwon

Publication date 15 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2513/25130209.htm

zbMATH Keywords

all one polynomialbasisfinite fieldsystolic multiplier

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• On low complexity bit parallel polynomial basis multipliers.
• Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• scientific article; zbMATH DE number 1878331
• More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials

Cited in

(5)

• Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• On low complexity bit parallel polynomial basis multipliers.
• A new bit-serial multiplier over GF(pm) using irreducible trinomials
• Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)

This page was built for publication:

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