High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
IEEE Transactions on Computers
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
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation
IEEE Transactions on Computers - Special issue on computer arithmetic
Redundant Integer Representations and Fast Exponentiation
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
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
RSA cryptosystem design based on the Chinese remainder theorem
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
VLSI Implementation of Modulo Multiplication Using Carry Free Addition
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
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)
A Hardware Algorithm for Modular Multiplication/Division
IEEE Transactions on Computers
Instruction set extensions for pairing-based cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 14.98 |
Radix-2 and radix-4 modular multiplication hardware algorithms are proposed. Numbers are represented in a redundant representation and modular additions are performed without carry propagation. Serial-parallel modular multipliers based on them have a regular cellular array structure with a bit slice feature suitable for VLSI implementation. They are efficient especially in applications, such as an RSA cryptosystem, where modular multiplications are performed iteratively.