NDLI: An alternate approach to modular multiplication for finite fields [GF (2/sup m/)] using Itoh Tsujii algorithm

Content Provider	IEEE Xplore Digital Library
Author	Bharathwaj, S.V. Narasimhan, K.L.
Copyright Year	2005
Description	Author affiliation: Dept. of Electron. & Commun. Eng., Sri Venkateswara Coll. of Eng., Sriperumbudur, India (Bharathwaj, S.V.)
Abstract	Modular arithmetic operations especially modular multiplication have extensive applications in elliptic curve cryptanalysis, error control coding and linear recurring sequences. These operations have steadily grown in the word size in the past. Current designs and approaches may not be the most efficient for such high word sizes. Also usually, most approaches optimize for either area or speed, not both. In this paper, we examine certain properties and elucidate certain alternative strategies of and on the Itoh Tsujii algorithm (Guajardo and Paar, 2002) that will make it suitable for this emerging scenario. These strategies take a holistic approach to the problem, and aims at optimizing both speed and area for a given word length. These claims are supported by mathematical analysis, simulation and synthesis of a prototype of the suggested strategy. We also examine various enhancements that can be effected in the given architecture.
Starting Page	103
Ending Page	105
File Size	243816
Page Count	3
File Format	PDF
ISBN	0780389344
DOI	10.1109/NEWCAS.2005.1496668
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-06-22
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Galois fields Arithmetic Elliptic curves Educational institutions Error correction Mathematical analysis Analytical models Virtual prototyping Scalability
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

Multiplication and inversion over a class of GF(2/sup m/)

Extended abstract: Unified digit-serial multiplier/inverter in finite field $GF(2^{m})$

Revisiting scalable modular multiplication over GF(2/sup m/) for elliptic curve cryptography

A compact finite field processor over GF(2/sup m/) for elliptic curve cryptography

A low-power bit-serial multiplier for finite fields GF(2/sup m/)

Efficient multiplication in GF(p/sup k/) for elliptic curve cryptography

A vector multiply-accumulate architecture for GF(2/sup m/)

A low-area, high-speed, processor array architecture for field ALU over GF $(2^{m})$

Low-complexity modified Mastrovito multipliers over finite fields GF(2/sup M/)

An alternate approach to modular multiplication for finite fields [GF (2/sup m/)] using Itoh Tsujii algorithm

Similar Documents

Multiplication and inversion over a class of GF(2/sup m/)

Extended abstract: Unified digit-serial multiplier/inverter in finite field $GF(2^{m})$

Revisiting scalable modular multiplication over GF(2/sup m/) for elliptic curve cryptography

A compact finite field processor over GF(2/sup m/) for elliptic curve cryptography

A low-power bit-serial multiplier for finite fields GF(2/sup m/)

Efficient multiplication in GF(p/sup k/) for elliptic curve cryptography

A vector multiply-accumulate architecture for GF(2/sup m/)

A low-area, high-speed, processor array architecture for field ALU over GF $(2^{m})$

Low-complexity modified Mastrovito multipliers over finite fields GF(2/sup M/)

An alternate approach to modular multiplication for finite fields [GF (2/sup m/)] using Itoh Tsujii algorithm