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.
|Commitee:||Khoo, I-Hung, Yeh, Hen-Geul|
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 56/04M(E), Masters Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be