scientific article; zbMATH DE number 2024675

zbMATH Open1114.94013MaRDI QIDQ4443244

Ronald C. Mullin

Publication date: 11 January 2004

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials 👍 👎
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m) 👍 👎
• Architectures for exponentiation in GF(2n) 👍 👎
• Comb Architectures for Finite Field Multiplication in F(2^m) 👍 👎
• Efficient multiplier architectures for Galois fields GF(2/sup 4n/) 👍 👎
• A simplified architecture for module (2/sup n/+1) multiplication 👍 👎
• A universal architecture for designing efficient modulo 2/sup n/+1 multipliers 👍 👎

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