Dissertation/Thesis Abstract

Modulo Multipliers with Adaptive Delay for a High Dynamic Range Residue Number System Using Booth Encoding
by Reddy, Ginni Sumanth, M.S., California State University, Long Beach, 2017, 47; 10263534
Abstract (Summary)

The complex computation in public key cryptography involving repetitive multiplication of extensive word length can be accelerated without reducing the system performance by using the time difference created by the non-critical path of a special moduli set of residue number system of high dynamic range. The current project demonstrates radix-8 Booth encoded modulo 2n-1 multipliers. A Carry Select Adder (CSA) tree, with an end-around-carry addition for the collection of unnecessary partial products and a Sklansky parallel-prefix structure, have been implemented. Simulation results show that the presented method can produce substantial savings in required area and power consumption.

Indexing (document details)
Advisor: Chassiakos, Anastasios
Commitee: Khoo, I-Hung, Yeh, Hen-Geul
School: California State University, Long Beach
Department: Electrical Engineering
School Location: United States -- California
Source: MAI 56/04M(E), Masters Abstracts International
Subjects: Electrical engineering
Publication Number: 10263534
ISBN: 978-1-369-80506-2
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy