A fast VLSI conversion between binary and residue systems
Information Processing Letters
Area-time optimal VLSI integer multiplier with minimum computation time
Information and Control
A VLSI model for residue number system architectures
Integration, the VLSI Journal
The Area-Time Complexity of Binary Multiplication
Journal of the ACM (JACM)
Introduction to VLSI Systems
A complexity theory for VLSI
A New Euclidean Division Algorithm for Residue Number Systems
Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
New Efficient Structure for a Modular Multiplier for RNS
IEEE Transactions on Computers
High-Speed and Reduced-Area Modular Adder Structures for RNS
IEEE Transactions on Computers
IEEE Transactions on Computers
Fast Combinatorial RNS Processors for DSP Applications
IEEE Transactions on Computers
Fast modular exponentiation of large numbers with large exponents
Journal of Systems Architecture: the EUROMICRO Journal
Hardware architectures for public key cryptography
Integration, the VLSI Journal
How to fake an RSA signature by encoding modular root finding as a SAT problem
Discrete Applied Mathematics - The renesse issue on satisfiability
Resource requirements for the application of addition chains in modulo exponentiation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 14.99 |
A novel method to compute the exact digits of the modulo m product of integers is proposed, and a modulo m multiply structure is defined. Such a structure can be implemented by means of a few fast VLSI binary multipliers, and a response time of about 150-200 ns to perform modular multiplications with moduli up to 32767 can be reached. A comparison to ROM-based structures is also provided. The modular multiplier has been evaluated asymptotically, according to the VLSI complexity theory, and it turned out to be an optimal design. This structure can be used to implement a residue multiplier in arithmetic structures using residue number systems (RNSs). The complexity of this residue multiplier has been evaluated and lower complexity figures than for ROM-based multiply structures have been obtained under several hypotheses on RNS parameters.