NDLI: An Efficient Reconfigurable Montgomery Multiplier Architecture for GF(n)

Content Provider	IEEE Xplore Digital Library
Author	Kamala, R.V. Sudhakar, M. Srinivas, M.B.
Copyright Year	2006
Description	Author affiliation: Center for VLSI & Embedded Syst. Technol., Int. Inst. of Inf. Technol., Andhra Pradesh (Kamala, R.V.; Sudhakar, M.; Srinivas, M.B.)
Abstract	In this paper, the authors propose an efficient reconfigurable Montgomery multiplier for Galois prime field GF(n) that employs carry-save addition. The multiplier can operate for any operand length 'k' where 1<klesN. The value of N determines the maximum operand length that the multiplier can support, which is application dependent. The value 'k' can be changed and hence can be configured and programmed. The final result can be obtained in 'k+1' clock cycles of operation after reset. The advantages of the proposed design are high order of flexibility, which allows easy reconfigurability for any operand length and low hardware complexity. The minimal area overhead to achieve reconfigurability is another major advantage. The critical path delay of the design is 6TXOR+TAND+T4:1MUX+T2:1MUX, where TXOR, TAND, T4:1MUX, and T2:1MUX are delays of 2-input XOR, 2-input AND, 4:1 multiplexer and 2:1 multiplexer respectively. To the best of our knowledge this appears to be the only reconfigurable architecture for Montgomery multiplication over Galois prime field. Further, clock and signal gating techniques have been employed for low-power consumption of the multiplier
Sponsorship	IEEE CPS
Starting Page	155
Ending Page	159
File Size	123114
Page Count	5
File Format	PDF
ISBN	0769526098
DOI	10.1109/DSD.2006.23
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-30
Publisher Place	Croatia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Delay Reconfigurable architectures Field programmable gate arrays Very large scale integration Clocks Multiplexing Arithmetic Elliptic curve cryptography Embedded system Information technology
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

A Unified, Reconfigurable Architecture for Montgomery Multiplication in Finite Fields GF(p) and GF(2^n)

High-Throughput Montgomery Modular Multiplication

Serial multiplier architectures over GF(2/sup n/) for elliptic curve cryptosystems

Efficient montgomery multiplier for pairing and elliptic curve based cryptography

A Microcoded Elliptic Curve Processor for GF(2m) Using FPGA Technology

Scalable VLSI architecture for GF(p) Montgomery modular inverse computation

VLSI Implementation of a Cryptography-Oriented Reconfigurable Array

Reconfigurable Architectures for Curve-Based Cryptography on Embedded Micro-Controllers

Low complexity montgomery multiplication architecture for elliptic curve cryptography over $GF(p^{m})$

An Efficient Reconfigurable Montgomery Multiplier Architecture for GF(n)

Similar Documents

A Unified, Reconfigurable Architecture for Montgomery Multiplication in Finite Fields GF(p) and GF(2^n)

High-Throughput Montgomery Modular Multiplication

Serial multiplier architectures over GF(2/sup n/) for elliptic curve cryptosystems

Efficient montgomery multiplier for pairing and elliptic curve based cryptography

A Microcoded Elliptic Curve Processor for GF(2m) Using FPGA Technology

Scalable VLSI architecture for GF(p) Montgomery modular inverse computation

VLSI Implementation of a Cryptography-Oriented Reconfigurable Array

Reconfigurable Architectures for Curve-Based Cryptography on Embedded Micro-Controllers

Low complexity montgomery multiplication architecture for elliptic curve cryptography over $GF(p^{m})$

An Efficient Reconfigurable Montgomery Multiplier Architecture for GF(n)