High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
IEEE Transactions on Computers
IEEE Transactions on Computers
Hardware speedups in long integer multiplication
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A survey of hardware implementations of RSA (abstract)
CRYPTO '89 Proceedings on Advances in cryptology
A fast modular-multiplication algorithm based on a higher radix
CRYPTO '89 Proceedings on Advances in cryptology
IEEE Transactions on Computers
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Low power scalable encryption for wireless systems
Wireless Networks - Special issue VLSI in wireless networks
Design and implementation of a scalable encryption processor with embedded variable DC/DC converter
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Radix-4 modular multiplication and exponentiation algorithms for the RSA public-key cryptosystem
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Performance-Scalable Array Architectures for Modular Multiplication
Journal of VLSI Signal Processing Systems
Fast Combinatorial RNS Processors for DSP Applications
IEEE Transactions on Computers
A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Hardware architectures for public key cryptography
Integration, the VLSI Journal
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2001 international conference on computer design (ICCD)
Bipartite modular multiplication
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
High-Speed RSA crypto-processor with radix-4 modular multiplication and chinese remainder theorem
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Instruction set extensions for pairing-based cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
A fast radix-4 modular multiplication hardware algorithm is proposed. It is efficient for modular exponentiation with a large modulus, used in public-key cryptosystems such as the RSA cryptosystem. The operands and the result of multiplication which are intermediate results in modular exponentiation are represented in a redundant representation. The computation proceeds in serial-parallel fashion. Each subtraction for the division for residue calculation is embedded in the repeated multiply-add. Each intermediate result is represented in a more redundant representation than that for the operands and the result, so that the number of the required addition/subtractions is reduced. All addition/subtraction are carried out without carry propagation. A serial-parallel modular multiplier based on the algorithm has a regular cellular array structure with a bit slice feature and is suitable for VLSI implementation.