Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.

Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.

Long word-length integer multiplication is widely acknowledged as the bottleneck operation in public key cryptographic and signal processing algorithms. Residue Number System (RNS) has emerged as a promising alternative number representation for the design of faster and low power multipliers owing t...

Full description

Saved in:
Bibliographic Details
Main Author: Ramya Muralidharan
Other Authors: Chang Chip Hong
Format: Theses and Dissertations
Language:English
Published: 2012
Subjects:
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Online Access:https://hdl.handle.net/10356/50689
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-50689
record_format dspace
spelling sg-ntu-dr.10356-506892023-07-04T16:55:12Z Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1. Ramya Muralidharan Chang Chip Hong School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems Long word-length integer multiplication is widely acknowledged as the bottleneck operation in public key cryptographic and signal processing algorithms. Residue Number System (RNS) has emerged as a promising alternative number representation for the design of faster and low power multipliers owing to its merit to distribute a long integer multiplication into several shorter and parallel modulo multiplications. To maximize the advantages offered by the RNS multiplier, judicious choice of moduli that constitute the RNS base and design of efficient modulo multipliers are imperative. In this thesis, special modulo 2^n-1, modulo 2^n and modulo 2^n+1 multipliers are studied. By manipulating the number theoretic properties of special moduli, 2^n-1, 2^n and 2^n+1, new low-power and low-area modulo multipliers are proposed. DOCTOR OF PHILOSOPHY (EEE) 2012-09-03T05:14:37Z 2012-09-03T05:14:37Z 2012 2012 Thesis Ramya M. (2012). Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/50689 10.32657/10356/50689 en 162 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Ramya Muralidharan
Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
description Long word-length integer multiplication is widely acknowledged as the bottleneck operation in public key cryptographic and signal processing algorithms. Residue Number System (RNS) has emerged as a promising alternative number representation for the design of faster and low power multipliers owing to its merit to distribute a long integer multiplication into several shorter and parallel modulo multiplications. To maximize the advantages offered by the RNS multiplier, judicious choice of moduli that constitute the RNS base and design of efficient modulo multipliers are imperative. In this thesis, special modulo 2^n-1, modulo 2^n and modulo 2^n+1 multipliers are studied. By manipulating the number theoretic properties of special moduli, 2^n-1, 2^n and 2^n+1, new low-power and low-area modulo multipliers are proposed.
author2 Chang Chip Hong
author_facet Chang Chip Hong
Ramya Muralidharan
format Theses and Dissertations
author Ramya Muralidharan
author_sort Ramya Muralidharan
title Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
title_short Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
title_full Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
title_fullStr Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
title_full_unstemmed Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
title_sort novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
publishDate 2012
url https://hdl.handle.net/10356/50689
_version_ 1772828735341330432

Similar Items