Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem
Issue No.07 - July (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.256444
<p>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.</p>
modular multiplication hardware algorithms; redundant representation; RSA cryptosystem; multipliers; cellular array structure; bit slice feature; VLSI implementation; cryptography; digital arithmetic; VLSI.
N. Takagi, "Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem", IEEE Transactions on Computers, vol.41, no. 7, pp. 887-891, July 1992, doi:10.1109/12.256444