Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)

DOI10.1631/JZUS.A0820398zbMath1185.68314MaRDI QIDQ1048342

Jenn-Shyong Horng, Chiou-Yng Lee, I.-Chang Jou

Publication date: 11 January 2010

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

zbMATH Keywords

normal basiselliptic curve cryptosystemfinite field multiplicationGaussian normal basis

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low complexity normal bases
• Optimal normal bases in \(GF(p^ n)\)
• An implementation for a fast public-key cryptosystem
• Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
• An efficient optimal normal basis type II multiplier
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
• A modified Massey-Omura parallel multiplier for a class of finite fields
• On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)
• Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials
• Multiplexer-based array multipliers
• Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)

This page was built for publication: Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)