scientific article; zbMATH DE number 1941247

MaRDI QIDQ4408448zbMATH OpenFDO

Authors Soonhak Kwon, Heuisu Ryu

Publication date 29 June 2003

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

zbMATH Keywords

bit serial multiplicationdual basisFinite fieldoptimal normal basis of type II

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient Multiplication Using Type 2 Optimal Normal Bases
• Area-Efficient Subquadratic Space-Complexity Digit-Serial Multiplier for Type-II Optimal Normal Basis of <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> Using Symmetric TMVP and Block Recombination Te
• On bit-serial multiplication and dual bases in GF(2/sup m/)
• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)
• EFFICIENT PARALLEL GAUSSIAN NORMAL BASES MULTIPLIERS OVER FINITE FIELDS
• A dual basis bit-serial systolic multiplier for GF(2 )
• Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
• Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
• LFSR-based Bit-Serial GF(2ᵐ) Multipliers using Irreducible Trinomials

Cited in

(6)

• Dual bases and bit-serial multiplication in \(\mathbb F_q^n\).
• An efficient optimal normal basis type II multiplier
• Type-II optimal polynomial bases
• EFFICIENT PARALLEL GAUSSIAN NORMAL BASES MULTIPLIERS OVER FINITE FIELDS
• scientific article; zbMATH DE number 4102995 (Why is no real title available?)
• Efficient Multiplication Using Type 2 Optimal Normal Bases

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 Q4408448)