On complexity of normal basis multiplier using modified Booth's algorithm

Authors:
Jenn-Shyong Horng;I-Chang Jou;Chiou-Yng Lee
Affiliations:
Department of Computer and Communication Engineering, National Kaohsiung First University of Science and Technology, Kaohsiung, Taiwan, R.O.C.;Department of Computer and Communication Engineering, National Kaohsiung First University of Science and Technology, Kaohsiung, Taiwan, R.O.C.;Department of Computer Information and Network Engineering Lunghwa University of Science and Technology, Taoyuan County, Taiwan, R.O.C.
Venue:
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
Year:
2007

Citing 14
Cited 1

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Multiplexer-Based Array Multipliers

IEEE Transactions on Computers
An Efficient Optimal Normal Basis Type II Multiplier

IEEE Transactions on Computers
Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials

IEEE Transactions on Computers
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})

IEEE Transactions on Computers
The Eigentrust algorithm for reputation management in P2P networks

WWW '03 Proceedings of the 12th international conference on World Wide Web
A reputation system for peer-to-peer networks

NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Managing and Sharing Servents' Reputations in P2P Systems

IEEE Transactions on Knowledge and Data Engineering
Towards Practical Automated Trust Negotiation

POLICY '02 Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks (POLICY'02)
Fast Normal Basis Multiplication Using General Purpose Processors

IEEE Transactions on Computers
Limited reputation sharing in P2P systems

EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Low Complexity Word-Level Sequential Normal Basis Multipliers

IEEE Transactions on Computers
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases

IEEE Transactions on Computers
Relationship Algebra for Computing in Social Networks and Social Network Based Applications

WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence

The new architecture of Chinese abacus multiplier

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper purposed a Booth's multiplier for normal basis multiplier. The architecture is simple and highly regular architecture for finite fields using a new modified Booth's algorithm. The proposed multiplier for finite fields requires a significantly lower number of bit level operations and, hence, can reduce the space complexity of cryptographic systems. It is shown that proposed multiplier for type-2 normal basis of GF(2m) saves approximately 10% space complexity as compared to related parallel multipliers. Moreover, the proposed architecture is regularity and modularity; they are well suited to VLSI implementations.