NDLI: A Scalable Architecture for Dual Basis GF(2m) Multiplications

Content Provider	IEEE Xplore Digital Library
Author	Liang-Hwa Chen Po-Lun Chang Yen-Ching Chang Chiou-Yng Lee
Copyright Year	2012
Abstract	A novel low-complexity scalable architecture for dual basis multiplications over GF(2m) is proposed in this paper. This multiplier architecture is derived from the Hankel matrix-vector representation of dual basis multiplication, and is feasible for the finite fields generated by irreducible trinomials. By appropriately selecting its digit size, the proposed scalable architecture can achieve a satisfactory trade-off between hardware complexity and throughput performance for implementing ECC cryptosystems such as ECDSA in resource-constrained environments such as embedded systems and smart cards. Analytical results exhibit that the space complexity of the proposed multiplier architecture is substantially lower than that of the non-scalable architectures. Besides, owing to its features of regularity, modularity and concurrency, the proposed architecture is highly feasible for VLSI implementations.
Starting Page	45
Ending Page	50
File Size	206084
Page Count	6
File Format	PDF
ISBN	9781467309172
DOI	10.1109/ISBAST.2012.13
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-03-26
Publisher Place	Taiwan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Finite field Latches Dual basis Hankel matrix-vector Computer architecture Elliptic curve cryptography (ECC) Logic gates Scalable multiplier Vectors Registers Complexity theory Cryptography
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast Optimal Normal Basis Multiplier with Type-2kw Over GF (2m)

Digit-Serial GNB Multiplier Based on TMVP Approach over GF(2m)

Design of low complexity $GF(2^{m})$ multiplier based on Karatsuba algorithm

Low space-complexity digit-serial dual basis systolic multiplier over Galois field GF(2 m ) using Hankel matrix and Karatsuba algorithm

Efficient bit-serial finite field montgomery multiplier in $GF(2^{m})$

Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach

A Word-Level Finite Field Multiplier Using Normal Basis

Novel Mastrovito Multiplier over GF(2m) Using Trinomial

Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2^m)

A Scalable Architecture for Dual Basis GF(2m) Multiplications

Similar Documents

Fast Optimal Normal Basis Multiplier with Type-2kw Over GF (2m)

Digit-Serial GNB Multiplier Based on TMVP Approach over GF(2m)

Design of low complexity $GF(2^{m})$ multiplier based on Karatsuba algorithm

Low space-complexity digit-serial dual basis systolic multiplier over Galois field GF(2 m ) using Hankel matrix and Karatsuba algorithm

Efficient bit-serial finite field montgomery multiplier in $GF(2^{m})$

Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach

A Word-Level Finite Field Multiplier Using Normal Basis

Novel Mastrovito Multiplier over GF(2m) Using Trinomial

Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2^m)

A Scalable Architecture for Dual Basis GF(2m) Multiplications