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...
Saved in:
Main Author: | Ramya Muralidharan |
---|---|
Other Authors: | Chang Chip Hong |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2012
|
Subjects: | |
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 |
Similar Items
-
Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
by: Muralidharan, Ramya, et al.
Published: (2013) -
Hard multiple generator for higher radix modulo 2^n-1 multiplication
by: Muralidharan, Ramya, et al.
Published: (2010) -
Modulo adders, multipliers and shared-moduli architectures for moduli of type
by: Shibu, Menon
Published: (2008) -
New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
by: Tay, Thian Fatt, et al.
Published: (2015) -
Simple, fast, and exact RNS scaler for the three-moduli set {2n - 1, 2n, 2n + 1}
by: Chang, Chip-Hong, et al.
Published: (2015)